Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716624281001

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 08:04:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 08:04:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:04:42] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2024-05-25 08:04:42] [INFO ] Transformed 4914 places.
[2024-05-25 08:04:42] [INFO ] Transformed 6913 transitions.
[2024-05-25 08:04:42] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Normalized transition count is 6641 out of 6913 initially.
// Phase 1: matrix 6641 rows 4914 cols
[2024-05-25 08:04:43] [INFO ] Computed 535 invariants in 337 ms
Incomplete random walk after 10000 steps, including 192 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :4
[2024-05-25 08:04:44] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2024-05-25 08:04:44] [INFO ] Computed 535 invariants in 172 ms
[2024-05-25 08:04:44] [INFO ] [Real]Absence check using 48 positive place invariants in 73 ms returned sat
[2024-05-25 08:04:45] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 151 ms returned unsat
[2024-05-25 08:04:45] [INFO ] [Real]Absence check using 48 positive place invariants in 59 ms returned sat
[2024-05-25 08:04:45] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 128 ms returned unsat
[2024-05-25 08:04:46] [INFO ] [Real]Absence check using 48 positive place invariants in 59 ms returned sat
[2024-05-25 08:04:46] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 139 ms returned unsat
[2024-05-25 08:04:46] [INFO ] [Real]Absence check using 48 positive place invariants in 66 ms returned sat
[2024-05-25 08:04:47] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 191 ms returned sat
[2024-05-25 08:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:04:51] [INFO ] [Real]Absence check using state equation in 4350 ms returned unknown
[2024-05-25 08:04:52] [INFO ] [Real]Absence check using 48 positive place invariants in 55 ms returned sat
[2024-05-25 08:04:52] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 185 ms returned sat
[2024-05-25 08:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:04:56] [INFO ] [Real]Absence check using state equation in 4303 ms returned unknown
[2024-05-25 08:04:57] [INFO ] [Real]Absence check using 48 positive place invariants in 67 ms returned sat
[2024-05-25 08:04:57] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 132 ms returned unsat
[2024-05-25 08:04:57] [INFO ] [Real]Absence check using 48 positive place invariants in 52 ms returned sat
[2024-05-25 08:04:57] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 168 ms returned sat
[2024-05-25 08:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:05:02] [INFO ] [Real]Absence check using state equation in 4291 ms returned sat
[2024-05-25 08:05:02] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:05:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:911)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 08:05:02] [INFO ] [Real]Absence check using 48 positive place invariants in 55 ms returned sat
[2024-05-25 08:05:02] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 189 ms returned sat
[2024-05-25 08:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:05:07] [INFO ] [Real]Absence check using state equation in 4368 ms returned unknown
[2024-05-25 08:05:07] [INFO ] [Real]Absence check using 48 positive place invariants in 55 ms returned sat
[2024-05-25 08:05:08] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 200 ms returned sat
[2024-05-25 08:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:05:12] [INFO ] [Real]Absence check using state equation in 4314 ms returned unknown
[2024-05-25 08:05:12] [INFO ] [Real]Absence check using 48 positive place invariants in 50 ms returned sat
[2024-05-25 08:05:13] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 181 ms returned sat
[2024-05-25 08:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:05:17] [INFO ] [Real]Absence check using state equation in 4335 ms returned unknown
[2024-05-25 08:05:17] [INFO ] [Real]Absence check using 48 positive place invariants in 53 ms returned sat
[2024-05-25 08:05:17] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 132 ms returned unsat
[2024-05-25 08:05:18] [INFO ] [Real]Absence check using 48 positive place invariants in 52 ms returned sat
[2024-05-25 08:05:18] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 126 ms returned unsat
[2024-05-25 08:05:19] [INFO ] [Real]Absence check using 48 positive place invariants in 59 ms returned sat
[2024-05-25 08:05:19] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 132 ms returned unsat
[2024-05-25 08:05:19] [INFO ] [Real]Absence check using 48 positive place invariants in 53 ms returned sat
[2024-05-25 08:05:19] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 191 ms returned sat
[2024-05-25 08:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:05:24] [INFO ] [Real]Absence check using state equation in 4364 ms returned unknown
[2024-05-25 08:05:24] [INFO ] [Real]Absence check using 48 positive place invariants in 55 ms returned sat
[2024-05-25 08:05:24] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 121 ms returned unsat
[2024-05-25 08:05:25] [INFO ] [Real]Absence check using 48 positive place invariants in 56 ms returned sat
[2024-05-25 08:05:25] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 122 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 51, 1, 1, 1, 51, 1, 51, 1, 1, 1, 51, 1, 1] Max seen :[1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.19 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1356 transitions
Trivial Post-agglo rules discarded 1356 transitions
Performed 1356 trivial Post agglomeration. Transition count delta: 1356
Iterating post reduction 0 with 1356 rules applied. Total rules applied 1357 place count 4884 transition count 5557
Reduce places removed 1356 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1360 rules applied. Total rules applied 2717 place count 3528 transition count 5553
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2721 place count 3524 transition count 5553
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 2721 place count 3524 transition count 5383
Deduced a syphon composed of 170 places in 5 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3061 place count 3354 transition count 5383
Discarding 1186 places :
Symmetric choice reduction at 3 with 1186 rule applications. Total rules 4247 place count 2168 transition count 4197
Iterating global reduction 3 with 1186 rules applied. Total rules applied 5433 place count 2168 transition count 4197
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 5433 place count 2168 transition count 4189
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 5449 place count 2160 transition count 4189
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 5683 place count 1926 transition count 3019
Iterating global reduction 3 with 234 rules applied. Total rules applied 5917 place count 1926 transition count 3019
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5951 place count 1909 transition count 3002
Free-agglomeration rule (complex) applied 164 times.
Iterating global reduction 3 with 164 rules applied. Total rules applied 6115 place count 1909 transition count 3774
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 3 with 164 rules applied. Total rules applied 6279 place count 1745 transition count 3774
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 6313 place count 1745 transition count 3774
Applied a total of 6313 rules in 1506 ms. Remains 1745 /4914 variables (removed 3169) and now considering 3774/6913 (removed 3139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1510 ms. Remains : 1745/4914 places, 3774/6913 transitions.
Normalized transition count is 3376 out of 3774 initially.
// Phase 1: matrix 3376 rows 1745 cols
[2024-05-25 08:05:27] [INFO ] Computed 505 invariants in 47 ms
Incomplete random walk after 1000000 steps, including 31859 resets, run finished after 12515 ms. (steps per millisecond=79 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 1000001 steps, including 5668 resets, run finished after 2818 ms. (steps per millisecond=354 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5669 resets, run finished after 2803 ms. (steps per millisecond=356 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 5668 resets, run finished after 2829 ms. (steps per millisecond=353 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000000 steps, including 5669 resets, run finished after 2814 ms. (steps per millisecond=355 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5669 resets, run finished after 2815 ms. (steps per millisecond=355 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5669 resets, run finished after 2818 ms. (steps per millisecond=354 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 5669 resets, run finished after 2823 ms. (steps per millisecond=354 ) properties (out of 7) seen :4
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-25 08:05:59] [INFO ] Flow matrix only has 3376 transitions (discarded 398 similar events)
// Phase 1: matrix 3376 rows 1745 cols
[2024-05-25 08:05:59] [INFO ] Computed 505 invariants in 44 ms
[2024-05-25 08:05:59] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-25 08:05:59] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 30 ms returned unsat
[2024-05-25 08:05:59] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-25 08:05:59] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 83 ms returned sat
[2024-05-25 08:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:06:00] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2024-05-25 08:06:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:06:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-25 08:06:01] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 73 ms returned sat
[2024-05-25 08:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:06:02] [INFO ] [Nat]Absence check using state equation in 946 ms returned sat
[2024-05-25 08:06:02] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:06:04] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1883 ms returned sat
[2024-05-25 08:06:04] [INFO ] Computed and/alt/rep : 1578/3620/1578 causal constraints (skipped 1781 transitions) in 288 ms.
[2024-05-25 08:06:05] [INFO ] Added : 15 causal constraints over 3 iterations in 1076 ms. Result :sat
[2024-05-25 08:06:05] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-25 08:06:05] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 45 ms returned unsat
[2024-05-25 08:06:05] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-25 08:06:05] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 77 ms returned sat
[2024-05-25 08:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:06:06] [INFO ] [Real]Absence check using state equation in 944 ms returned sat
[2024-05-25 08:06:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:06:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-25 08:06:07] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 84 ms returned sat
[2024-05-25 08:06:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:06:08] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2024-05-25 08:06:09] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1418 ms returned unsat
[2024-05-25 08:06:09] [INFO ] [Real]Absence check using 33 positive place invariants in 45 ms returned sat
[2024-05-25 08:06:09] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 29 ms returned unsat
[2024-05-25 08:06:10] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-25 08:06:10] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 0, 1, 1] Max seen :[1, 0, 1, 0, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1745/1745 places, 3774/3774 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1745 transition count 3772
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1743 transition count 3772
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 1739 transition count 3768
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 1739 transition count 3768
Applied a total of 12 rules in 268 ms. Remains 1739 /1745 variables (removed 6) and now considering 3768/3774 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 1739/1745 places, 3768/3774 transitions.
Normalized transition count is 3370 out of 3768 initially.
// Phase 1: matrix 3370 rows 1739 cols
[2024-05-25 08:06:10] [INFO ] Computed 505 invariants in 60 ms
Incomplete random walk after 1000000 steps, including 31853 resets, run finished after 12196 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5669 resets, run finished after 2796 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2024-05-25 08:06:25] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
// Phase 1: matrix 3370 rows 1739 cols
[2024-05-25 08:06:25] [INFO ] Computed 505 invariants in 36 ms
[2024-05-25 08:06:25] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2024-05-25 08:06:25] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 83 ms returned sat
[2024-05-25 08:06:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:06:26] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2024-05-25 08:06:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:06:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2024-05-25 08:06:27] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 85 ms returned sat
[2024-05-25 08:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:06:28] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2024-05-25 08:06:28] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:06:29] [INFO ] [Nat]Added 1906 Read/Feed constraints in 872 ms returned sat
[2024-05-25 08:06:30] [INFO ] Deduced a trap composed of 367 places in 1138 ms of which 10 ms to minimize.
[2024-05-25 08:06:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1321 ms
[2024-05-25 08:06:30] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 512 ms.
[2024-05-25 08:06:32] [INFO ] Added : 34 causal constraints over 9 iterations in 2502 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 120 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 1739/1739 places, 3768/3768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 103 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
[2024-05-25 08:06:33] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2024-05-25 08:06:33] [INFO ] Invariant cache hit.
[2024-05-25 08:06:36] [INFO ] Implicit Places using invariants in 3191 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 142, 144, 157, 163, 165, 166, 167, 168, 169, 170, 172, 176, 182, 190, 200, 212, 225, 237, 238, 239, 240, 241, 242, 252, 260, 266, 270, 272, 274, 287, 293, 295, 296, 297, 298, 299, 300, 302, 304, 308, 314, 322, 332, 343, 353, 354, 355, 356, 357, 358, 366, 372, 376, 378, 380, 382, 395, 401, 403, 404, 405, 406, 407, 408, 410, 412, 414, 418, 424, 432, 441, 449, 450, 451, 452, 453, 454, 460, 464, 466, 468, 470, 472, 485, 491, 493, 494, 495, 496, 497, 498, 500, 502, 504, 506, 510, 516, 523, 529, 530, 531, 532, 533, 534, 538, 540, 542, 544, 546, 548, 561, 567, 569, 570, 571, 572, 573, 574, 576, 578, 580, 582, 584, 588, 593, 597, 598, 599, 600, 601, 602, 604, 606, 608, 610, 612, 614, 627, 633, 635, 636, 637, 638, 639, 640, 642, 644, 646, 648, 650, 652, 655, 657, 658, 659, 660, 661, 662, 664, 666, 668, 670, 672, 674, 687, 693, 695, 696, 697, 698, 699, 700, 702, 704, 706, 708, 710, 712, 714, 716, 717, 718, 719, 720, 721, 723, 725, 727, 729, 731, 733, 746, 748, 751, 753, 754, 755, 756, 757, 758, 760, 762, 764, 766, 768, 770, 772, 774, 775, 776, 777, 778, 779, 781, 783, 785, 787, 789, 791, 804, 810, 812, 813, 814, 815, 816, 817, 819, 821, 823, 825, 827, 829, 831, 833, 834, 835, 836, 837, 838, 840, 842, 844, 846, 848, 850, 863, 869, 871, 872, 873, 874, 875, 876, 878, 880, 882, 884, 886, 888, 890, 893, 894, 895, 896, 897, 898, 900, 902, 904, 906, 908, 910, 923, 929, 931, 932, 933, 934, 935, 936, 938, 940, 942, 944, 946, 948, 952, 957, 958, 959, 960, 961, 962, 966, 968, 970, 972, 974, 976, 989, 995, 997, 998, 999, 1000, 1001, 1002, 1004, 1006, 1008, 1010, 1012, 1016, 1022, 1029, 1030, 1031, 1032, 1033, 1034, 1040, 1044, 1046, 1048, 1050, 1052, 1065, 1071, 1073, 1074, 1075, 1076, 1077, 1078, 1080, 1082, 1084, 1086, 1090, 1096, 1104, 1113, 1114, 1115, 1116, 1117, 1118, 1126, 1132, 1136, 1138, 1140, 1142, 1155, 1161, 1163, 1164, 1165, 1166, 1167, 1168, 1170, 1172, 1174, 1178, 1184, 1192, 1202, 1213, 1214, 1215, 1216, 1217, 1218, 1228, 1236, 1242, 1246, 1248, 1250, 1263, 1269, 1271, 1272, 1273, 1274, 1275, 1276, 1278, 1280, 1284, 1290, 1298, 1308, 1320, 1333, 1334, 1335, 1336, 1337, 1338, 1350, 1360, 1368, 1374, 1378, 1380, 1393, 1395, 1398, 1400, 1401, 1402, 1403, 1404, 1405, 1407, 1411, 1417, 1425, 1435, 1447, 1461, 1476, 1477, 1478, 1479, 1480, 1481, 1495, 1507, 1517, 1525, 1531, 1535, 1548]
Discarding 462 places :
Implicit Place search using SMT only with invariants took 3211 ms to find 462 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1277/1739 places, 3768/3768 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 1117 transition count 3608
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 1117 transition count 3608
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 480 place count 957 transition count 3448
Iterating global reduction 0 with 160 rules applied. Total rules applied 640 place count 957 transition count 3448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 643 place count 957 transition count 3445
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 646 place count 954 transition count 3445
Applied a total of 646 rules in 245 ms. Remains 954 /1277 variables (removed 323) and now considering 3445/3768 (removed 323) transitions.
[2024-05-25 08:06:36] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2024-05-25 08:06:36] [INFO ] Computed 43 invariants in 43 ms
[2024-05-25 08:06:37] [INFO ] Implicit Places using invariants in 1059 ms returned []
[2024-05-25 08:06:37] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-25 08:06:37] [INFO ] Invariant cache hit.
[2024-05-25 08:06:38] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:06:55] [INFO ] Implicit Places using invariants and state equation in 17250 ms returned []
Implicit Place search using SMT with State Equation took 18316 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 954/1739 places, 3445/3768 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21875 ms. Remains : 954/1739 places, 3445/3768 transitions.
Normalized transition count is 3047 out of 3445 initially.
// Phase 1: matrix 3047 rows 954 cols
[2024-05-25 08:06:55] [INFO ] Computed 43 invariants in 30 ms
Incomplete random walk after 1000000 steps, including 34078 resets, run finished after 11439 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4032 resets, run finished after 1904 ms. (steps per millisecond=525 ) properties (out of 1) seen :0
[2024-05-25 08:07:08] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2024-05-25 08:07:08] [INFO ] Computed 43 invariants in 33 ms
[2024-05-25 08:07:08] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 08:07:08] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-25 08:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:07:09] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2024-05-25 08:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:07:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 08:07:09] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-25 08:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:07:09] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2024-05-25 08:07:09] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:07:10] [INFO ] [Nat]Added 1906 Read/Feed constraints in 651 ms returned sat
[2024-05-25 08:07:11] [INFO ] Deduced a trap composed of 207 places in 435 ms of which 11 ms to minimize.
[2024-05-25 08:07:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 581 ms
[2024-05-25 08:07:11] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 170 ms.
[2024-05-25 08:07:11] [INFO ] Added : 15 causal constraints over 3 iterations in 673 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 80 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 79 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2024-05-25 08:07:12] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-25 08:07:12] [INFO ] Invariant cache hit.
[2024-05-25 08:07:13] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2024-05-25 08:07:13] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-25 08:07:13] [INFO ] Invariant cache hit.
[2024-05-25 08:07:14] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:07:31] [INFO ] Implicit Places using invariants and state equation in 18135 ms returned []
Implicit Place search using SMT with State Equation took 19182 ms to find 0 implicit places.
[2024-05-25 08:07:31] [INFO ] Redundant transitions in 219 ms returned []
[2024-05-25 08:07:31] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-25 08:07:31] [INFO ] Invariant cache hit.
[2024-05-25 08:07:32] [INFO ] Dead Transitions using invariants and state equation in 1286 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20775 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
Normalized transition count is 3047 out of 3445 initially.
// Phase 1: matrix 3047 rows 954 cols
[2024-05-25 08:07:32] [INFO ] Computed 43 invariants in 41 ms
Incomplete random walk after 10000 steps, including 340 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2024-05-25 08:07:33] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2024-05-25 08:07:33] [INFO ] Computed 43 invariants in 24 ms
[2024-05-25 08:07:33] [INFO ] [Real]Absence check using 31 positive place invariants in 27 ms returned sat
[2024-05-25 08:07:33] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-25 08:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:07:34] [INFO ] [Real]Absence check using state equation in 724 ms returned sat
[2024-05-25 08:07:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:07:34] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-25 08:07:34] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-25 08:07:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:07:34] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2024-05-25 08:07:34] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:07:35] [INFO ] [Nat]Added 1906 Read/Feed constraints in 643 ms returned sat
[2024-05-25 08:07:35] [INFO ] Deduced a trap composed of 207 places in 463 ms of which 11 ms to minimize.
[2024-05-25 08:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 621 ms
[2024-05-25 08:07:36] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 266 ms.
[2024-05-25 08:07:36] [INFO ] Added : 15 causal constraints over 3 iterations in 780 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 94 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 954/954 places, 3445/3445 transitions.
Normalized transition count is 3047 out of 3445 initially.
// Phase 1: matrix 3047 rows 954 cols
[2024-05-25 08:07:37] [INFO ] Computed 43 invariants in 27 ms
Incomplete random walk after 1000000 steps, including 34072 resets, run finished after 11490 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4033 resets, run finished after 1890 ms. (steps per millisecond=529 ) properties (out of 1) seen :0
[2024-05-25 08:07:50] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2024-05-25 08:07:50] [INFO ] Computed 43 invariants in 23 ms
[2024-05-25 08:07:50] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 08:07:50] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-25 08:07:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:07:51] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2024-05-25 08:07:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:07:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-25 08:07:51] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-25 08:07:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:07:52] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-05-25 08:07:52] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:07:52] [INFO ] [Nat]Added 1906 Read/Feed constraints in 637 ms returned sat
[2024-05-25 08:07:53] [INFO ] Deduced a trap composed of 207 places in 424 ms of which 1 ms to minimize.
[2024-05-25 08:07:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 583 ms
[2024-05-25 08:07:53] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 171 ms.
[2024-05-25 08:07:54] [INFO ] Added : 15 causal constraints over 3 iterations in 665 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 77 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 75 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2024-05-25 08:07:54] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-25 08:07:54] [INFO ] Invariant cache hit.
[2024-05-25 08:07:55] [INFO ] Implicit Places using invariants in 995 ms returned []
[2024-05-25 08:07:55] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-25 08:07:55] [INFO ] Invariant cache hit.
[2024-05-25 08:07:56] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-25 08:08:12] [INFO ] Implicit Places using invariants and state equation in 17099 ms returned []
Implicit Place search using SMT with State Equation took 18110 ms to find 0 implicit places.
[2024-05-25 08:08:12] [INFO ] Redundant transitions in 153 ms returned []
[2024-05-25 08:08:12] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-25 08:08:12] [INFO ] Invariant cache hit.
[2024-05-25 08:08:13] [INFO ] Dead Transitions using invariants and state equation in 1324 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19684 ms. Remains : 954/954 places, 3445/3445 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04 in 41067 ms.
[2024-05-25 08:08:14] [INFO ] Flatten gal took : 486 ms
[2024-05-25 08:08:15] [INFO ] Applying decomposition
[2024-05-25 08:08:15] [INFO ] Flatten gal took : 199 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2606389084351054394.txt' '-o' '/tmp/graph2606389084351054394.bin' '-w' '/tmp/graph2606389084351054394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2606389084351054394.bin' '-l' '-1' '-v' '-w' '/tmp/graph2606389084351054394.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:08:15] [INFO ] Decomposing Gal with order
[2024-05-25 08:08:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:08:17] [INFO ] Removed a total of 5811 redundant transitions.
[2024-05-25 08:08:17] [INFO ] Flatten gal took : 1437 ms
[2024-05-25 08:08:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2549 labels/synchronizations in 357 ms.
[2024-05-25 08:08:18] [INFO ] Time to serialize gal into /tmp/UpperBounds6099224414607501721.gal : 64 ms
[2024-05-25 08:08:18] [INFO ] Time to serialize properties into /tmp/UpperBounds5553752331223795281.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6099224414607501721.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5553752331223795281.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds5553752331223795281.prop.
Detected timeout of ITS tools.
[2024-05-25 08:29:53] [INFO ] Flatten gal took : 721 ms
[2024-05-25 08:29:53] [INFO ] Time to serialize gal into /tmp/UpperBounds17479069996699973978.gal : 89 ms
[2024-05-25 08:29:53] [INFO ] Time to serialize properties into /tmp/UpperBounds1187601344510722528.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17479069996699973978.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1187601344510722528.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds1187601344510722528.prop.
Detected timeout of ITS tools.
[2024-05-25 08:51:07] [INFO ] Flatten gal took : 1033 ms
[2024-05-25 08:51:15] [INFO ] Input system was already deterministic with 3445 transitions.
[2024-05-25 08:51:15] [INFO ] Transformed 954 places.
[2024-05-25 08:51:15] [INFO ] Transformed 3445 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 08:51:16] [INFO ] Time to serialize gal into /tmp/UpperBounds5830336666487482464.gal : 95 ms
[2024-05-25 08:51:16] [INFO ] Time to serialize properties into /tmp/UpperBounds5425641487635255154.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5830336666487482464.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5425641487635255154.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5425641487635255154.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 165520 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15763888 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r263-tall-171654371900016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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