fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089415900507
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Referendum-COL-1000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
531.132 471388.00 496778.00 2437.80 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1 1 1 normal

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-162089415900507.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-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415900507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.2K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 13:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 13:57 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 41K 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-1000-UpperBounds-00
FORMULA_NAME Referendum-COL-1000-UpperBounds-01
FORMULA_NAME Referendum-COL-1000-UpperBounds-02
FORMULA_NAME Referendum-COL-1000-UpperBounds-03
FORMULA_NAME Referendum-COL-1000-UpperBounds-04
FORMULA_NAME Referendum-COL-1000-UpperBounds-05
FORMULA_NAME Referendum-COL-1000-UpperBounds-06
FORMULA_NAME Referendum-COL-1000-UpperBounds-07
FORMULA_NAME Referendum-COL-1000-UpperBounds-08
FORMULA_NAME Referendum-COL-1000-UpperBounds-09
FORMULA_NAME Referendum-COL-1000-UpperBounds-10
FORMULA_NAME Referendum-COL-1000-UpperBounds-11
FORMULA_NAME Referendum-COL-1000-UpperBounds-12
FORMULA_NAME Referendum-COL-1000-UpperBounds-13
FORMULA_NAME Referendum-COL-1000-UpperBounds-14
FORMULA_NAME Referendum-COL-1000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621260028523

Running Version 0
[2021-05-17 14:00:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:00:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:00:30] [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 14:00:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 14:00:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 541 ms
[2021-05-17 14:00:31] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 3001 PT places and 2001.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2021-05-17 14:00:31] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions in 3 ms.
[2021-05-17 14:00:31] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_17926330097496746237.dot
// Phase 1: matrix 3 rows 4 cols
[2021-05-17 14:00:31] [INFO ] Computed 1 place invariants in 3 ms
FORMULA Referendum-COL-1000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Referendum-COL-1000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Referendum-COL-1000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-17 14:00:31] [INFO ] Unfolded HLPN to a Petri net with 3001 places and 2001 transitions in 45 ms.
[2021-05-17 14:00:31] [INFO ] Unfolded HLPN properties in 2 ms.
// Phase 1: matrix 3 rows 4 cols
[2021-05-17 14:00:31] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-17 14:00:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 14:00:31] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 9 ms.
[2021-05-17 14:00:31] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 14:00:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 14:00:31] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 2 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 14:00:31] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 14:00:31] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 14:00:31] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 14:00:31] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 14:00:31] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 14:00:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 14:00:31] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 14:00:31] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 2 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-17 14:00:31] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 14:00:31] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 2 ms.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-17 14:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:31] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-17 14:00:31] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-17 14:00:31] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000, 1000]
[2021-05-17 14:00:31] [INFO ] Unfolded HLPN to a Petri net with 3001 places and 2001 transitions in 4 ms.
[2021-05-17 14:00:31] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_9454512336473143301.dot
Incomplete random walk after 10000 steps, including 9 resets, run finished after 5495 ms. (steps per millisecond=1 ) properties (out of 13) seen :10098
FORMULA Referendum-COL-1000-UpperBounds-11 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-1000-UpperBounds-09 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-1000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-1000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-1000-UpperBounds-05 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-1000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-COL-1000-UpperBounds-03 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 6) seen :8
// Phase 1: matrix 2001 rows 3001 cols
[2021-05-17 14:00:39] [INFO ] Computed 1000 place invariants in 28 ms
[2021-05-17 14:00:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 373 ms returned sat
[2021-05-17 14:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:41] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2021-05-17 14:00:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:00:42] [INFO ] [Nat]Absence check using 1000 positive place invariants in 322 ms returned sat
[2021-05-17 14:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:00:43] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2021-05-17 14:00:43] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 99 ms.
[2021-05-17 14:01:49] [INFO ] Deduced a trap composed of 4 places in 62697 ms of which 12 ms to minimize.
[2021-05-17 14:01: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 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 14:01:49] [INFO ] [Real]Absence check using 1000 positive place invariants in 288 ms returned sat
[2021-05-17 14:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:01:50] [INFO ] [Real]Absence check using state equation in 1022 ms returned sat
[2021-05-17 14:01:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:01:51] [INFO ] [Nat]Absence check using 1000 positive place invariants in 353 ms returned sat
[2021-05-17 14:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:01:52] [INFO ] [Nat]Absence check using state equation in 1017 ms returned sat
[2021-05-17 14:01:52] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 123 ms.
[2021-05-17 14:02:56] [INFO ] Deduced a trap composed of 4 places in 60261 ms of which 12 ms to minimize.
[2021-05-17 14:02:56] [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 14:02:56] [INFO ] [Real]Absence check using 1000 positive place invariants in 341 ms returned sat
[2021-05-17 14:02:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:02:57] [INFO ] [Real]Absence check using state equation in 996 ms returned sat
[2021-05-17 14:02:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:02:58] [INFO ] [Nat]Absence check using 1000 positive place invariants in 373 ms returned sat
[2021-05-17 14:02:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:02:59] [INFO ] [Nat]Absence check using state equation in 965 ms returned sat
[2021-05-17 14:02:59] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 188 ms.
[2021-05-17 14:03:58] [INFO ] Deduced a trap composed of 4 places in 55753 ms of which 3 ms to minimize.
[2021-05-17 14:03:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 14:03:59] [INFO ] [Real]Absence check using 1000 positive place invariants in 375 ms returned sat
[2021-05-17 14:03:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:04:00] [INFO ] [Real]Absence check using state equation in 899 ms returned sat
[2021-05-17 14:04:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:04:01] [INFO ] [Nat]Absence check using 1000 positive place invariants in 373 ms returned sat
[2021-05-17 14:04:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:04:02] [INFO ] [Nat]Absence check using state equation in 1043 ms returned sat
[2021-05-17 14:04:02] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 116 ms.
00)
^^
(error "Incorrect format for a number - no leading zeros allowed: 00")
[2021-05-17 14:04:59] [INFO ] Deduced a trap composed of 4 places in 53854 ms of which 4 ms to minimize.
[2021-05-17 14:04:59] [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)
[2021-05-17 14:04:59] [INFO ] [Real]Absence check using 1000 positive place invariants in 262 ms returned sat
[2021-05-17 14:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:05:01] [INFO ] [Real]Absence check using state equation in 1158 ms returned sat
[2021-05-17 14:05:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:05:01] [INFO ] [Nat]Absence check using 1000 positive place invariants in 333 ms returned sat
[2021-05-17 14:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:05:02] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2021-05-17 14:05:02] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 148 ms.
[2021-05-17 14:06:04] [INFO ] Deduced a trap composed of 4 places in 58725 ms of which 4 ms to minimize.
[2021-05-17 14:06:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 14:06:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 327 ms returned sat
[2021-05-17 14:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:06:06] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2021-05-17 14:06:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:06:07] [INFO ] [Nat]Absence check using 1000 positive place invariants in 350 ms returned sat
[2021-05-17 14:06:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:06:08] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2021-05-17 14:06:08] [INFO ] Computed and/alt/rep : 2000/2000/2000 causal constraints (skipped 0 transitions) in 128 ms.
[2021-05-17 14:06:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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) : [1000, 1000, 1000, 1000, 1000, 1000] Max seen :[515, 515, 519, 515, 519, 515]
Support contains 2000 out of 3001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3000 transition count 2000
Applied a total of 1 rules in 321 ms. Remains 3000 /3001 variables (removed 1) and now considering 2000/2001 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3001 places, 2000/2001 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:06:11] [INFO ] Computed 1000 place invariants in 14 ms
Interrupted random walk after 101434 steps, including 101 resets, run timeout after 30001 ms. (steps per millisecond=3 ) properties seen :{0=536, 1=536, 2=530, 3=536, 4=530, 5=536}
Interrupted Best-First random walk after 144525 steps, including 0 resets, run timeout after 5030 ms. (steps per millisecond=28 ) properties seen :{0=74, 1=74, 3=74, 5=74}
Interrupted Best-First random walk after 154761 steps, including 0 resets, run timeout after 5025 ms. (steps per millisecond=30 ) properties seen :{0=80, 1=80, 3=80, 5=80}
Interrupted Best-First random walk after 156602 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=31 ) properties seen :{2=81, 4=81}
Interrupted Best-First random walk after 162945 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=32 ) properties seen :{0=84, 1=84, 3=84, 5=84}
Interrupted Best-First random walk after 163946 steps, including 0 resets, run timeout after 5032 ms. (steps per millisecond=32 ) properties seen :{2=85, 4=85}
Interrupted Best-First random walk after 162945 steps, including 0 resets, run timeout after 5022 ms. (steps per millisecond=32 ) properties seen :{0=84, 1=84, 3=84, 5=84}
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:07:12] [INFO ] Computed 1000 place invariants in 9 ms
[2021-05-17 14:07:12] [INFO ] [Real]Absence check using 1000 positive place invariants in 377 ms returned sat
[2021-05-17 14:07:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:14] [INFO ] [Real]Absence check using state equation in 1209 ms returned sat
[2021-05-17 14:07:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:07:14] [INFO ] [Nat]Absence check using 1000 positive place invariants in 301 ms returned sat
[2021-05-17 14:07:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:15] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2021-05-17 14:07:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 65 ms.
[2021-05-17 14:07:15] [INFO ] Added : 0 causal constraints over 0 iterations in 232 ms. Result :sat
Minimization took 201 ms.
[2021-05-17 14:07:16] [INFO ] [Real]Absence check using 1000 positive place invariants in 336 ms returned sat
[2021-05-17 14:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:17] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2021-05-17 14:07:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:07:18] [INFO ] [Nat]Absence check using 1000 positive place invariants in 267 ms returned sat
[2021-05-17 14:07:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:19] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2021-05-17 14:07:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 116 ms.
[2021-05-17 14:07:20] [INFO ] Added : 0 causal constraints over 0 iterations in 322 ms. Result :sat
Minimization took 299 ms.
[2021-05-17 14:07:21] [INFO ] [Real]Absence check using 1000 positive place invariants in 335 ms returned sat
[2021-05-17 14:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:22] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2021-05-17 14:07:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:07:22] [INFO ] [Nat]Absence check using 1000 positive place invariants in 300 ms returned sat
[2021-05-17 14:07:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:24] [INFO ] [Nat]Absence check using state equation in 1068 ms returned sat
[2021-05-17 14:07:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 120 ms.
[2021-05-17 14:07:24] [INFO ] Added : 0 causal constraints over 0 iterations in 444 ms. Result :sat
Minimization took 287 ms.
[2021-05-17 14:07:25] [INFO ] [Real]Absence check using 1000 positive place invariants in 306 ms returned sat
[2021-05-17 14:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:26] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2021-05-17 14:07:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:07:27] [INFO ] [Nat]Absence check using 1000 positive place invariants in 293 ms returned sat
[2021-05-17 14:07:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:28] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2021-05-17 14:07:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 86 ms.
[2021-05-17 14:07:28] [INFO ] Added : 0 causal constraints over 0 iterations in 269 ms. Result :sat
Minimization took 263 ms.
[2021-05-17 14:07:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 367 ms returned sat
[2021-05-17 14:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:30] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2021-05-17 14:07:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:07:31] [INFO ] [Nat]Absence check using 1000 positive place invariants in 407 ms returned sat
[2021-05-17 14:07:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:32] [INFO ] [Nat]Absence check using state equation in 1110 ms returned sat
[2021-05-17 14:07:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 99 ms.
[2021-05-17 14:07:33] [INFO ] Added : 0 causal constraints over 0 iterations in 288 ms. Result :sat
Minimization took 317 ms.
[2021-05-17 14:07:34] [INFO ] [Real]Absence check using 1000 positive place invariants in 362 ms returned sat
[2021-05-17 14:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:35] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2021-05-17 14:07:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:07:35] [INFO ] [Nat]Absence check using 1000 positive place invariants in 269 ms returned sat
[2021-05-17 14:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:07:36] [INFO ] [Nat]Absence check using state equation in 996 ms returned sat
[2021-05-17 14:07:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 82 ms.
[2021-05-17 14:07:37] [INFO ] Added : 0 causal constraints over 0 iterations in 237 ms. Result :sat
Minimization took 243 ms.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000, 1000, 1000, 1000] Max seen :[536, 536, 530, 536, 530, 536]
Incomplete Parikh walk after 100000 steps, including 99 resets, run finished after 27055 ms. (steps per millisecond=3 ) properties (out of 6) seen :4000 could not realise parikh vector
FORMULA Referendum-COL-1000-UpperBounds-12 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Referendum-COL-1000-UpperBounds-08 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Referendum-COL-1000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Referendum-COL-1000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 100000 steps, including 99 resets, run finished after 15104 ms. (steps per millisecond=6 ) properties (out of 2) seen :2000 could not realise parikh vector
FORMULA Referendum-COL-1000-UpperBounds-10 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Referendum-COL-1000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621260499911

--------------------
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-1000"
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-1000, 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-162089415900507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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