About the Execution of 2021-gold for DatabaseWithMutex-COL-20
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.r071-tall-165254780500202.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 gold2021
Input is DatabaseWithMutex-COL-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-tall-165254780500202
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 7.5K Apr 30 06:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 06:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 38K May 10 09:33 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 DatabaseWithMutex-COL-20-UpperBounds-00
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-01
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-02
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-03
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-04
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-05
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-06
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-07
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-08
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-09
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-10
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-11
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-12
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-13
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-14
FORMULA_NAME DatabaseWithMutex-COL-20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652591289850
Running Version 0
[2022-05-15 05:08:11] [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-15 05:08:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:08:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-15 05:08:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 05:08:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 694 ms
[2022-05-15 05:08:12] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 3260 PT places and 3200.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-15 05:08:12] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions in 3 ms.
[2022-05-15 05:08:12] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_15322548426751198119.dot
// Phase 1: matrix 8 rows 11 cols
[2022-05-15 05:08:12] [INFO ] Computed 4 place invariants in 13 ms
FORMULA DatabaseWithMutex-COL-20-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-20-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-20-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-20-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-15 05:08:12] [INFO ] Unfolded HLPN to a Petri net with 3260 places and 3200 transitions in 73 ms.
[2022-05-15 05:08:12] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 8 rows 11 cols
[2022-05-15 05:08:12] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-15 05:08:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-15 05:08:12] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-15 05:08:12] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned unsat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-15 05:08:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-15 05:08:12] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 05:08:12] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-15 05:08:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-15 05:08:12] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 05:08:12] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-15 05:08:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-15 05:08:12] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 05:08:12] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned unsat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-15 05:08:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-15 05:08:12] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 05:08:12] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-15 05:08:12] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 05:08:12] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-15 05:08:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-15 05:08:12] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-15 05:08:12] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned unsat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-15 05:08:12] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 05:08:12] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-15 05:08:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-15 05:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:12] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-15 05:08:12] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-15 05:08:13] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20, 380, 20, 20, 380, 380, 20, 380, 380]
FORMULA DatabaseWithMutex-COL-20-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-20-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-20-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2022-05-15 05:08:13] [INFO ] Unfolded HLPN to a Petri net with 3260 places and 3200 transitions in 28 ms.
[2022-05-15 05:08:13] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_8811126335288148116.dot
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1230 ms. (steps per millisecond=8 ) properties (out of 9) seen :1145
FORMULA DatabaseWithMutex-COL-20-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :19
// Phase 1: matrix 3200 rows 3260 cols
[2022-05-15 05:08:15] [INFO ] Computed 460 place invariants in 284 ms
[2022-05-15 05:08:15] [INFO ] [Real]Absence check using 59 positive place invariants in 65 ms returned sat
[2022-05-15 05:08:16] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 748 ms returned sat
[2022-05-15 05:08:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:17] [INFO ] [Real]Absence check using state equation in 1468 ms returned sat
[2022-05-15 05:08:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:18] [INFO ] [Nat]Absence check using 59 positive place invariants in 58 ms returned sat
[2022-05-15 05:08:18] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 742 ms returned sat
[2022-05-15 05:08:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:20] [INFO ] [Nat]Absence check using state equation in 1508 ms returned sat
[2022-05-15 05:08:20] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 234 ms.
[2022-05-15 05:08:22] [INFO ] Added : 27 causal constraints over 6 iterations in 1588 ms. Result :sat
[2022-05-15 05:08:22] [INFO ] [Real]Absence check using 59 positive place invariants in 66 ms returned sat
[2022-05-15 05:08:23] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 765 ms returned sat
[2022-05-15 05:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:24] [INFO ] [Real]Absence check using state equation in 1675 ms returned sat
[2022-05-15 05:08:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:25] [INFO ] [Nat]Absence check using 59 positive place invariants in 57 ms returned sat
[2022-05-15 05:08:26] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 741 ms returned sat
[2022-05-15 05:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:27] [INFO ] [Nat]Absence check using state equation in 1603 ms returned sat
[2022-05-15 05:08:28] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 187 ms.
[2022-05-15 05:08:33] [INFO ] Deduced a trap composed of 37 places in 3259 ms of which 14 ms to minimize.
[2022-05-15 05:08:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-15 05:08:33] [INFO ] [Real]Absence check using 59 positive place invariants in 52 ms returned sat
[2022-05-15 05:08:34] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 760 ms returned sat
[2022-05-15 05:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:36] [INFO ] [Real]Absence check using state equation in 1499 ms returned sat
[2022-05-15 05:08:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:36] [INFO ] [Nat]Absence check using 59 positive place invariants in 55 ms returned sat
[2022-05-15 05:08:37] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 800 ms returned sat
[2022-05-15 05:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:38] [INFO ] [Nat]Absence check using state equation in 1520 ms returned sat
[2022-05-15 05:08:39] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 165 ms.
[2022-05-15 05:08:40] [INFO ] Added : 27 causal constraints over 6 iterations in 1215 ms. Result :sat
[2022-05-15 05:08:40] [INFO ] [Real]Absence check using 59 positive place invariants in 50 ms returned sat
[2022-05-15 05:08:41] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 724 ms returned sat
[2022-05-15 05:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:43] [INFO ] [Real]Absence check using state equation in 1732 ms returned sat
[2022-05-15 05:08:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:43] [INFO ] [Nat]Absence check using 59 positive place invariants in 59 ms returned sat
[2022-05-15 05:08:44] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 780 ms returned sat
[2022-05-15 05:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:45] [INFO ] [Nat]Absence check using state equation in 1505 ms returned sat
[2022-05-15 05:08:46] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 192 ms.
[2022-05-15 05:08:51] [INFO ] Deduced a trap composed of 37 places in 3122 ms of which 7 ms to minimize.
[2022-05-15 05:08:51] [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 3
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-15 05:08:51] [INFO ] [Real]Absence check using 59 positive place invariants in 53 ms returned sat
[2022-05-15 05:08:52] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 832 ms returned sat
[2022-05-15 05:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:54] [INFO ] [Real]Absence check using state equation in 1516 ms returned sat
[2022-05-15 05:08:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:08:54] [INFO ] [Nat]Absence check using 59 positive place invariants in 53 ms returned sat
[2022-05-15 05:08:55] [INFO ] [Nat]Absence check using 59 positive and 401 generalized place invariants in 894 ms returned sat
[2022-05-15 05:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:08:56] [INFO ] [Nat]Absence check using state equation in 1535 ms returned sat
[2022-05-15 05:08:57] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 800 transitions) in 201 ms.
[2022-05-15 05:08:58] [INFO ] Added : 22 causal constraints over 5 iterations in 1096 ms. Result :sat
Current structural bounds on expressions (after SMT) : [380, 380, 380, 380, 380] Max seen :[202, 270, 202, 270, 121]
Incomplete Parikh walk after 4200 steps, including 96 resets, run finished after 203 ms. (steps per millisecond=20 ) properties (out of 5) seen :176 could not realise parikh vector
Incomplete Parikh walk after 25500 steps, including 98 resets, run finished after 1552 ms. (steps per millisecond=16 ) properties (out of 5) seen :538 could not realise parikh vector
Incomplete Parikh walk after 25500 steps, including 98 resets, run finished after 1540 ms. (steps per millisecond=16 ) properties (out of 5) seen :513 could not realise parikh vector
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 820 place count 2840 transition count 2800
Free-agglomeration rule applied 400 times.
Iterating global reduction 2 with 400 rules applied. Total rules applied 1220 place count 2840 transition count 2400
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 2 with 400 rules applied. Total rules applied 1620 place count 2440 transition count 2400
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2020 place count 2440 transition count 2000
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 3 with 400 rules applied. Total rules applied 2420 place count 2040 transition count 2000
Applied a total of 2420 rules in 802 ms. Remains 2040 /3260 variables (removed 1220) and now considering 2000/3200 (removed 1200) transitions.
Finished structural reductions, in 1 iterations. Remains : 2040/3260 places, 2000/3200 transitions.
// Phase 1: matrix 2000 rows 2040 cols
[2022-05-15 05:09:02] [INFO ] Computed 440 place invariants in 71 ms
Interrupted random walk after 295563 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{0=136, 1=353, 2=136, 3=353, 4=295}
Interrupted Best-First random walk after 258778 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=51 ) properties seen :{0=380, 1=253, 2=380, 3=253, 4=19}
FORMULA DatabaseWithMutex-COL-20-UpperBounds-12 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-07 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 293613 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen :{0=380, 1=380, 2=299}
FORMULA DatabaseWithMutex-COL-20-UpperBounds-14 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-20-UpperBounds-11 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2000 rows 2040 cols
[2022-05-15 05:09:42] [INFO ] Computed 440 place invariants in 29 ms
[2022-05-15 05:09:42] [INFO ] [Real]Absence check using 38 positive place invariants in 28 ms returned sat
[2022-05-15 05:09:43] [INFO ] [Real]Absence check using 38 positive and 402 generalized place invariants in 288 ms returned sat
[2022-05-15 05:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:09:43] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2022-05-15 05:09:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:09:44] [INFO ] [Nat]Absence check using 38 positive place invariants in 25 ms returned sat
[2022-05-15 05:09:44] [INFO ] [Nat]Absence check using 38 positive and 402 generalized place invariants in 281 ms returned sat
[2022-05-15 05:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:09:45] [INFO ] [Nat]Absence check using state equation in 933 ms returned sat
[2022-05-15 05:09:45] [INFO ] Computed and/alt/rep : 800/800/800 causal constraints (skipped 800 transitions) in 102 ms.
[2022-05-15 05:09:45] [INFO ] Added : 0 causal constraints over 0 iterations in 260 ms. Result :sat
Minimization took 4420 ms.
Current structural bounds on expressions (after SMT) : [380] Max seen :[299]
Support contains 400 out of 2040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2040/2040 places, 2000/2000 transitions.
Drop transitions removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 2040 transition count 1600
Reduce places removed 400 places and 0 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Iterating post reduction 1 with 800 rules applied. Total rules applied 1200 place count 1640 transition count 1200
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 2 with 400 rules applied. Total rules applied 1600 place count 1240 transition count 1200
Applied a total of 1600 rules in 245 ms. Remains 1240 /2040 variables (removed 800) and now considering 1200/2000 (removed 800) transitions.
Finished structural reductions, in 1 iterations. Remains : 1240/2040 places, 1200/2000 transitions.
// Phase 1: matrix 1200 rows 1240 cols
[2022-05-15 05:09:50] [INFO ] Computed 440 place invariants in 29 ms
Interrupted random walk after 993382 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen :{0=315}
Interrupted Best-First random walk after 277029 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=55 ) properties seen :{0=380}
FORMULA DatabaseWithMutex-COL-20-UpperBounds-15 380 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652591426494
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="DatabaseWithMutex-COL-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is DatabaseWithMutex-COL-20, 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 r071-tall-165254780500202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-20.tgz
mv DatabaseWithMutex-COL-20 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;