Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415900499.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-COL-0500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415900499
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 13:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 22K May 5 16:51 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 Referendum-COL-0500-UpperBounds-00
FORMULA_NAME Referendum-COL-0500-UpperBounds-01
FORMULA_NAME Referendum-COL-0500-UpperBounds-02
FORMULA_NAME Referendum-COL-0500-UpperBounds-03
FORMULA_NAME Referendum-COL-0500-UpperBounds-04
FORMULA_NAME Referendum-COL-0500-UpperBounds-05
FORMULA_NAME Referendum-COL-0500-UpperBounds-06
FORMULA_NAME Referendum-COL-0500-UpperBounds-07
FORMULA_NAME Referendum-COL-0500-UpperBounds-08
FORMULA_NAME Referendum-COL-0500-UpperBounds-09
FORMULA_NAME Referendum-COL-0500-UpperBounds-10
FORMULA_NAME Referendum-COL-0500-UpperBounds-11
FORMULA_NAME Referendum-COL-0500-UpperBounds-12
FORMULA_NAME Referendum-COL-0500-UpperBounds-13
FORMULA_NAME Referendum-COL-0500-UpperBounds-14
FORMULA_NAME Referendum-COL-0500-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621259426285

Running Version 0
[2021-05-17 13:50:27] [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]
[2021-05-17 13:50:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:50:27] [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.
[2021-05-17 13:50:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 13:50:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 470 ms
[2021-05-17 13:50:28] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 1501 PT places and 1001.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2021-05-17 13:50:28] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions in 3 ms.
[2021-05-17 13:50:28] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_4876027437230159930.dot
// Phase 1: matrix 3 rows 4 cols
[2021-05-17 13:50:28] [INFO ] Computed 1 place invariants in 4 ms
FORMULA Referendum-COL-0500-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Referendum-COL-0500-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-17 13:50:28] [INFO ] Unfolded HLPN to a Petri net with 1501 places and 1001 transitions in 12 ms.
[2021-05-17 13:50:28] [INFO ] Unfolded HLPN properties in 1 ms.
// Phase 1: matrix 3 rows 4 cols
[2021-05-17 13:50:28] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 13:50:28] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 13:50:28] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 13:50:28] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 13:50:28] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Minimization took 3 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 13:50:28] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 13:50:28] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 13:50:28] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Minimization took 6 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 13:50:28] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 2 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 13:50:28] [INFO ] Added : 1 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 13:50:28] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 13:50:28] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 13:50:28] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 13:50:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-17 13:50:28] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:28] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2021-05-17 13:50:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 13:50:28] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500, 500]
[2021-05-17 13:50:28] [INFO ] Unfolded HLPN to a Petri net with 1501 places and 1001 transitions in 3 ms.
[2021-05-17 13:50:28] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_17623400069127762384.dot
Incomplete random walk after 10000 steps, including 19 resets, run finished after 3100 ms. (steps per millisecond=3 ) properties (out of 14) seen :4910
FORMULA Referendum-COL-0500-UpperBounds-12 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-0500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-0500-UpperBounds-05 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-0500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-0500-UpperBounds-02 500 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 9) seen :16
// Phase 1: matrix 1001 rows 1501 cols
[2021-05-17 13:50:33] [INFO ] Computed 500 place invariants in 26 ms
[2021-05-17 13:50:34] [INFO ] [Real]Absence check using 500 positive place invariants in 112 ms returned sat
[2021-05-17 13:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:34] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2021-05-17 13:50:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:34] [INFO ] [Nat]Absence check using 500 positive place invariants in 117 ms returned sat
[2021-05-17 13:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:35] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2021-05-17 13:50:35] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 63 ms.
[2021-05-17 13:50:51] [INFO ] Deduced a trap composed of 4 places in 11904 ms of which 5 ms to minimize.
[2021-05-17 13:50: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2021-05-17 13:50:51] [INFO ] [Real]Absence check using 500 positive place invariants in 132 ms returned sat
[2021-05-17 13:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:52] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2021-05-17 13:50:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:50:52] [INFO ] [Nat]Absence check using 500 positive place invariants in 137 ms returned sat
[2021-05-17 13:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:50:53] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2021-05-17 13:50:53] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 65 ms.
[2021-05-17 13:51:09] [INFO ] Deduced a trap composed of 4 places in 12252 ms of which 2 ms to minimize.
[2021-05-17 13:51:09] [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)
[2021-05-17 13:51:09] [INFO ] [Real]Absence check using 500 positive place invariants in 132 ms returned sat
[2021-05-17 13:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:51:10] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2021-05-17 13:51:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:51:10] [INFO ] [Nat]Absence check using 500 positive place invariants in 132 ms returned sat
[2021-05-17 13:51:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:51:11] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2021-05-17 13:51:11] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 60 ms.
[2021-05-17 13:51:27] [INFO ] Deduced a trap composed of 4 places in 12240 ms of which 1 ms to minimize.
[2021-05-17 13:51:27] [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 2
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)
[2021-05-17 13:51:27] [INFO ] [Real]Absence check using 500 positive place invariants in 138 ms returned sat
[2021-05-17 13:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:51:28] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2021-05-17 13:51:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:51:28] [INFO ] [Nat]Absence check using 500 positive place invariants in 141 ms returned sat
[2021-05-17 13:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:51:29] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2021-05-17 13:51:29] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 54 ms.
[2021-05-17 13:51: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 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.refineWithCausalOrder(DeadlockTester.java:858)
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)
[2021-05-17 13:51:33] [INFO ] [Real]Absence check using 500 positive place invariants in 146 ms returned sat
[2021-05-17 13:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:51:34] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2021-05-17 13:51:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:51:34] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2021-05-17 13:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:51:35] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2021-05-17 13:51:35] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 63 ms.
[2021-05-17 13:51:50] [INFO ] Deduced a trap composed of 4 places in 11334 ms of which 3 ms to minimize.
[2021-05-17 13:51:50] [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 4
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)
[2021-05-17 13:51:51] [INFO ] [Real]Absence check using 500 positive place invariants in 146 ms returned sat
[2021-05-17 13:51:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:51:51] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2021-05-17 13:51:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:51:51] [INFO ] [Nat]Absence check using 500 positive place invariants in 108 ms returned sat
[2021-05-17 13:51:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:51:52] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2021-05-17 13:51:52] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 50 ms.
[2021-05-17 13:52:08] [INFO ] Deduced a trap composed of 4 places in 11854 ms of which 2 ms to minimize.
[2021-05-17 13:52:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2021-05-17 13:52:08] [INFO ] [Real]Absence check using 500 positive place invariants in 134 ms returned sat
[2021-05-17 13:52:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:52:09] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2021-05-17 13:52:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:52:09] [INFO ] [Nat]Absence check using 500 positive place invariants in 137 ms returned sat
[2021-05-17 13:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:52:10] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2021-05-17 13:52:10] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 40 ms.
[2021-05-17 13:52:25] [INFO ] Deduced a trap composed of 4 places in 11405 ms of which 3 ms to minimize.
[2021-05-17 13:52:25] [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: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)
[2021-05-17 13:52:26] [INFO ] [Real]Absence check using 500 positive place invariants in 145 ms returned sat
[2021-05-17 13:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:52:26] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2021-05-17 13:52:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:52:26] [INFO ] [Nat]Absence check using 500 positive place invariants in 135 ms returned sat
[2021-05-17 13:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:52:27] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2021-05-17 13:52:27] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 61 ms.
[2021-05-17 13:52:43] [INFO ] Deduced a trap composed of 4 places in 12133 ms of which 2 ms to minimize.
[2021-05-17 13:52:43] [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 7
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)
[2021-05-17 13:52:44] [INFO ] [Real]Absence check using 500 positive place invariants in 139 ms returned sat
[2021-05-17 13:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 13:52:44] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2021-05-17 13:52:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 13:52:44] [INFO ] [Nat]Absence check using 500 positive place invariants in 140 ms returned sat
[2021-05-17 13:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 13:52:45] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2021-05-17 13:52:45] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 52 ms.
[2021-05-17 13:52:49] [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 8
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.refineWithCausalOrder(DeadlockTester.java:858)
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)
Current structural bounds on expressions (after SMT) : [500, 500, 500, 500, 500, 500, 500, 500, 500] Max seen :[270, 266, 266, 270, 266, 266, 270, 266, 270]
Support contains 1000 out of 1501 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1500 transition count 1000
Applied a total of 1 rules in 200 ms. Remains 1500 /1501 variables (removed 1) and now considering 1000/1001 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1500/1501 places, 1000/1001 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2021-05-17 13:52:49] [INFO ] Computed 500 place invariants in 6 ms
Interrupted random walk after 166638 steps, including 332 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=281, 1=280, 2=280, 3=281, 4=280, 5=280, 6=281, 7=280, 8=281}
Interrupted Best-First random walk after 242537 steps, including 0 resets, run timeout after 5002 ms. (steps per millisecond=48 ) properties seen :{0=408, 3=408, 6=408, 8=408}
Interrupted Best-First random walk after 260921 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=52 ) properties seen :{1=500, 2=500, 4=500, 5=500, 7=500}
FORMULA Referendum-COL-0500-UpperBounds-14 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-COL-0500-UpperBounds-10 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-COL-0500-UpperBounds-09 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-COL-0500-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-COL-0500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 256977 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=51 ) properties seen :{0=500, 1=500, 2=500, 3=500}
FORMULA Referendum-COL-0500-UpperBounds-15 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-COL-0500-UpperBounds-13 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-COL-0500-UpperBounds-08 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-COL-0500-UpperBounds-00 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621259615365

--------------------
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="Referendum-COL-0500"
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 Referendum-COL-0500, 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 r178-tajo-162089415900499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0500.tgz
mv Referendum-COL-0500 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 ;