Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.9M
-rw-r--r-- 1 mcc users 16K Apr 29 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 29 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 29 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 7.6M May 10 09:34 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-S24C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652838269762

Running Version 202205111006
[2022-05-18 01:44:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 01:44:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 01:44:31] [INFO ] Load time of PNML (sax parser for PT used): 557 ms
[2022-05-18 01:44:31] [INFO ] Transformed 7032 places.
[2022-05-18 01:44:31] [INFO ] Transformed 10855 transitions.
[2022-05-18 01:44:31] [INFO ] Parsed PT model containing 7032 places and 10855 transitions in 707 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 10255 out of 10855 initially.
// Phase 1: matrix 10255 rows 7032 cols
[2022-05-18 01:44:32] [INFO ] Computed 813 place invariants in 1052 ms
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 471 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 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 85 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 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 85 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :5
[2022-05-18 01:44:33] [INFO ] Flow matrix only has 10255 transitions (discarded 600 similar events)
// Phase 1: matrix 10255 rows 7032 cols
[2022-05-18 01:44:34] [INFO ] Computed 813 place invariants in 389 ms
[2022-05-18 01:44:35] [INFO ] [Real]Absence check using 58 positive place invariants in 99 ms returned sat
[2022-05-18 01:44:35] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 304 ms returned sat
[2022-05-18 01:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:39] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-18 01:44:39] [INFO ] [Real]Absence check using 58 positive place invariants in 100 ms returned sat
[2022-05-18 01:44:40] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 182 ms returned unsat
[2022-05-18 01:44:40] [INFO ] [Real]Absence check using 58 positive place invariants in 93 ms returned sat
[2022-05-18 01:44:41] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 284 ms returned sat
[2022-05-18 01:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:45] [INFO ] [Real]Absence check using state equation in 3963 ms returned unknown
[2022-05-18 01:44:45] [INFO ] [Real]Absence check using 58 positive place invariants in 97 ms returned sat
[2022-05-18 01:44:46] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 300 ms returned sat
[2022-05-18 01:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:50] [INFO ] [Real]Absence check using state equation in 4030 ms returned unknown
[2022-05-18 01:44:50] [INFO ] [Real]Absence check using 58 positive place invariants in 92 ms returned sat
[2022-05-18 01:44:51] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 176 ms returned unsat
[2022-05-18 01:44:51] [INFO ] [Real]Absence check using 58 positive place invariants in 94 ms returned sat
[2022-05-18 01:44:51] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 177 ms returned unsat
[2022-05-18 01:44:52] [INFO ] [Real]Absence check using 58 positive place invariants in 88 ms returned sat
[2022-05-18 01:44:52] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 178 ms returned unsat
[2022-05-18 01:44:53] [INFO ] [Real]Absence check using 58 positive place invariants in 88 ms returned sat
[2022-05-18 01:44:53] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 174 ms returned unsat
[2022-05-18 01:44:54] [INFO ] [Real]Absence check using 58 positive place invariants in 97 ms returned sat
[2022-05-18 01:44:54] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 192 ms returned unsat
[2022-05-18 01:44:55] [INFO ] [Real]Absence check using 58 positive place invariants in 95 ms returned sat
[2022-05-18 01:44:55] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 326 ms returned sat
[2022-05-18 01:44:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:44:59] [INFO ] [Real]Absence check using state equation in 3918 ms returned unknown
[2022-05-18 01:45:00] [INFO ] [Real]Absence check using 58 positive place invariants in 93 ms returned sat
[2022-05-18 01:45:00] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 191 ms returned unsat
[2022-05-18 01:45:01] [INFO ] [Real]Absence check using 58 positive place invariants in 87 ms returned sat
[2022-05-18 01:45:01] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 296 ms returned sat
[2022-05-18 01:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:45:05] [INFO ] [Real]Absence check using state equation in 4004 ms returned unknown
[2022-05-18 01:45:06] [INFO ] [Real]Absence check using 58 positive place invariants in 92 ms returned sat
[2022-05-18 01:45:06] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 194 ms returned unsat
[2022-05-18 01:45:06] [INFO ] [Real]Absence check using 58 positive place invariants in 91 ms returned sat
[2022-05-18 01:45:07] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 179 ms returned unsat
[2022-05-18 01:45:07] [INFO ] [Real]Absence check using 58 positive place invariants in 90 ms returned sat
[2022-05-18 01:45:08] [INFO ] [Real]Absence check using 58 positive and 755 generalized place invariants in 181 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 7032 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7032/7032 places, 10855/10855 transitions.
Graph (complete) has 26261 edges and 7032 vertex of which 7000 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.37 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1201 place count 7000 transition count 9655
Reduce places removed 1200 places and 0 transitions.
Iterating post reduction 1 with 1200 rules applied. Total rules applied 2401 place count 5800 transition count 9655
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 2401 place count 5800 transition count 9555
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 2601 place count 5700 transition count 9555
Discarding 1100 places :
Symmetric choice reduction at 2 with 1100 rule applications. Total rules 3701 place count 4600 transition count 8455
Iterating global reduction 2 with 1100 rules applied. Total rules applied 4801 place count 4600 transition count 8455
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4801 place count 4600 transition count 8451
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4809 place count 4596 transition count 8451
Discarding 550 places :
Symmetric choice reduction at 2 with 550 rule applications. Total rules 5359 place count 4046 transition count 7351
Iterating global reduction 2 with 550 rules applied. Total rules applied 5909 place count 4046 transition count 7351
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 5959 place count 4021 transition count 7326
Free-agglomeration rule (complex) applied 335 times.
Iterating global reduction 2 with 335 rules applied. Total rules applied 6294 place count 4021 transition count 7541
Reduce places removed 335 places and 0 transitions.
Iterating post reduction 2 with 335 rules applied. Total rules applied 6629 place count 3686 transition count 7541
Applied a total of 6629 rules in 3932 ms. Remains 3686 /7032 variables (removed 3346) and now considering 7541/10855 (removed 3314) transitions.
Finished structural reductions, in 1 iterations. Remains : 3686/7032 places, 7541/10855 transitions.
Normalized transition count is 6656 out of 7541 initially.
// Phase 1: matrix 6656 rows 3686 cols
[2022-05-18 01:45:12] [INFO ] Computed 781 place invariants in 170 ms
Incomplete random walk after 1000000 steps, including 76429 resets, run finished after 16018 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2757 ms. (steps per millisecond=362 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2751 ms. (steps per millisecond=363 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2755 ms. (steps per millisecond=362 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2746 ms. (steps per millisecond=364 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2766 ms. (steps per millisecond=361 ) properties (out of 5) seen :0
[2022-05-18 01:45:42] [INFO ] Flow matrix only has 6656 transitions (discarded 885 similar events)
// Phase 1: matrix 6656 rows 3686 cols
[2022-05-18 01:45:42] [INFO ] Computed 781 place invariants in 169 ms
[2022-05-18 01:45:42] [INFO ] [Real]Absence check using 49 positive place invariants in 71 ms returned sat
[2022-05-18 01:45:42] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 177 ms returned sat
[2022-05-18 01:45:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:45:45] [INFO ] [Real]Absence check using state equation in 2232 ms returned sat
[2022-05-18 01:45:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:45:45] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2022-05-18 01:45:45] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 177 ms returned sat
[2022-05-18 01:45:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:45:48] [INFO ] [Nat]Absence check using state equation in 2299 ms returned sat
[2022-05-18 01:45:48] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2022-05-18 01:45:51] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 01:45:54] [INFO ] [Nat]Added 3202 Read/Feed constraints in 6205 ms returned unknown
[2022-05-18 01:45:54] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 01:45:55] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 174 ms returned sat
[2022-05-18 01:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:45:57] [INFO ] [Real]Absence check using state equation in 2207 ms returned sat
[2022-05-18 01:45:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:45:57] [INFO ] [Nat]Absence check using 49 positive place invariants in 62 ms returned sat
[2022-05-18 01:45:58] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 164 ms returned sat
[2022-05-18 01:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:00] [INFO ] [Nat]Absence check using state equation in 2206 ms returned sat
[2022-05-18 01:46:00] [INFO ] [Nat]Added 3202 Read/Feed constraints in 309 ms returned unsat
[2022-05-18 01:46:00] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2022-05-18 01:46:01] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 171 ms returned sat
[2022-05-18 01:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:03] [INFO ] [Real]Absence check using state equation in 2162 ms returned sat
[2022-05-18 01:46:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:46:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 01:46:03] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 168 ms returned sat
[2022-05-18 01:46:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:06] [INFO ] [Nat]Absence check using state equation in 2312 ms returned sat
[2022-05-18 01:46:06] [INFO ] [Nat]Added 3202 Read/Feed constraints in 322 ms returned unsat
[2022-05-18 01:46:06] [INFO ] [Real]Absence check using 49 positive place invariants in 62 ms returned sat
[2022-05-18 01:46:07] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 147 ms returned sat
[2022-05-18 01:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:09] [INFO ] [Real]Absence check using state equation in 2278 ms returned sat
[2022-05-18 01:46:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:46:09] [INFO ] [Nat]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 01:46:10] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 171 ms returned sat
[2022-05-18 01:46:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:12] [INFO ] [Nat]Absence check using state equation in 2244 ms returned sat
[2022-05-18 01:46:12] [INFO ] [Nat]Added 3202 Read/Feed constraints in 323 ms returned unsat
[2022-05-18 01:46:13] [INFO ] [Real]Absence check using 49 positive place invariants in 64 ms returned sat
[2022-05-18 01:46:13] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 179 ms returned sat
[2022-05-18 01:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:15] [INFO ] [Real]Absence check using state equation in 2206 ms returned sat
[2022-05-18 01:46:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:46:15] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2022-05-18 01:46:16] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 151 ms returned sat
[2022-05-18 01:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:18] [INFO ] [Nat]Absence check using state equation in 2296 ms returned sat
[2022-05-18 01:46:18] [INFO ] [Nat]Added 3202 Read/Feed constraints in 241 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 0, 0, 0, 0] Max seen :[0, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 3686 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3686/3686 places, 7541/7541 transitions.
Applied a total of 0 rules in 480 ms. Remains 3686 /3686 variables (removed 0) and now considering 7541/7541 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3686/3686 places, 7541/7541 transitions.
Normalized transition count is 6656 out of 7541 initially.
// Phase 1: matrix 6656 rows 3686 cols
[2022-05-18 01:46:19] [INFO ] Computed 781 place invariants in 147 ms
Incomplete random walk after 1000000 steps, including 76434 resets, run finished after 15507 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9167 resets, run finished after 2732 ms. (steps per millisecond=366 ) properties (out of 1) seen :0
[2022-05-18 01:46:37] [INFO ] Flow matrix only has 6656 transitions (discarded 885 similar events)
// Phase 1: matrix 6656 rows 3686 cols
[2022-05-18 01:46:37] [INFO ] Computed 781 place invariants in 164 ms
[2022-05-18 01:46:38] [INFO ] [Real]Absence check using 49 positive place invariants in 66 ms returned sat
[2022-05-18 01:46:38] [INFO ] [Real]Absence check using 49 positive and 732 generalized place invariants in 171 ms returned sat
[2022-05-18 01:46:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:40] [INFO ] [Real]Absence check using state equation in 2236 ms returned sat
[2022-05-18 01:46:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 01:46:41] [INFO ] [Nat]Absence check using 49 positive place invariants in 67 ms returned sat
[2022-05-18 01:46:41] [INFO ] [Nat]Absence check using 49 positive and 732 generalized place invariants in 168 ms returned sat
[2022-05-18 01:46:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 01:46:43] [INFO ] [Nat]Absence check using state equation in 2227 ms returned sat
[2022-05-18 01:46:43] [INFO ] State equation strengthened by 3202 read => feed constraints.
[2022-05-18 01:46:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 01:46:49] [INFO ] [Nat]Added 3202 Read/Feed constraints in 5789 ms returned unsat
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA MultiCrashLeafsetExtension-PT-S24C02-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 138455 ms.

BK_STOP 1652838409417

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S24C02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C02, 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 r132-tall-165271821200709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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