About the Execution of Marcie+red for Philosophers-COL-050000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r298-tall-167873951400173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Philosophers-COL-050000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951400173
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 5 18:23 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 Philosophers-COL-050000-UpperBounds-00
FORMULA_NAME Philosophers-COL-050000-UpperBounds-01
FORMULA_NAME Philosophers-COL-050000-UpperBounds-02
FORMULA_NAME Philosophers-COL-050000-UpperBounds-03
FORMULA_NAME Philosophers-COL-050000-UpperBounds-04
FORMULA_NAME Philosophers-COL-050000-UpperBounds-05
FORMULA_NAME Philosophers-COL-050000-UpperBounds-06
FORMULA_NAME Philosophers-COL-050000-UpperBounds-07
FORMULA_NAME Philosophers-COL-050000-UpperBounds-08
FORMULA_NAME Philosophers-COL-050000-UpperBounds-09
FORMULA_NAME Philosophers-COL-050000-UpperBounds-10
FORMULA_NAME Philosophers-COL-050000-UpperBounds-11
FORMULA_NAME Philosophers-COL-050000-UpperBounds-12
FORMULA_NAME Philosophers-COL-050000-UpperBounds-13
FORMULA_NAME Philosophers-COL-050000-UpperBounds-14
FORMULA_NAME Philosophers-COL-050000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679471363096
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-050000
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 07:49:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 07:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:49:24] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 07:49:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 07:49:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1219 ms
[2023-03-22 07:49:25] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250000 PT places and 250000.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 07:49:25] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-22 07:49:25] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 07:49:25] [INFO ] Computed 2 place invariants in 4 ms
FORMULA Philosophers-COL-050000-UpperBounds-15 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-13 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-10 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-09 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-08 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-06 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-050000-UpperBounds-00 50000 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 07:49:25] [INFO ] Invariant cache hit.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 07:49:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 07:49:26] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 07:49:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 07:49:26] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 07:49:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 07:49:26] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 07:49:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 07:49:26] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 07:49:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 07:49:26] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 07:49:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 07:49:26] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 07:49:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 07:49:26] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 07:49:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 07:49:26] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 07:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 07:49:26] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 07:49:26] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 07:49:26] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50000) 50000) 50000)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 07:49:27] [INFO ] Unfolded HLPN to a Petri net with 250000 places and 250000 transitions 800000 arcs in 1281 ms.
[2023-03-22 07:49:28] [INFO ] Unfolded 9 HLPN properties in 28 ms.
Finished random walk after 777 steps, including 0 resets, run visited all 9 properties in 30032 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7185 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7297 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7092 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6780 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6923 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6804 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6847 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6954 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6963 ms. (steps per millisecond=0 ) properties seen 3
// Phase 1: matrix 250000 rows 250000 cols
[2023-03-22 07:51:04] [INFO ] Computed 100000 place invariants in 1381 ms
[2023-03-22 07:51:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:51:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:51:19] [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 2
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:51:24] [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 3
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:51:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:51:34] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:51:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:51:44] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:51: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[394, 394, 394, 373, 373, 5, 373, 5, 373]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 2058 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2078 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-22 07:51:51] [INFO ] Invariant cache hit.
Finished random walk after 790 steps, including 0 resets, run visited all 9 properties in 30005 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6926 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6868 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6841 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6902 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6853 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6815 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6973 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6997 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6870 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-22 07:53:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[403, 403, 403, 382, 382, 5, 382, 5, 382]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1392 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1392 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1343 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-22 08:00:12] [INFO ] Invariant cache hit.
[2023-03-22 08:00:32] [INFO ] Implicit Places using invariants in 19979 ms returned []
Implicit Place search using SMT only with invariants took 19985 ms to find 0 implicit places.
[2023-03-22 08:00:32] [INFO ] Invariant cache hit.
[2023-03-22 08:00:51] [INFO ] Dead Transitions using invariants and state equation in 18607 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39942 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-22 08:00:51] [INFO ] Invariant cache hit.
Finished random walk after 790 steps, including 0 resets, run visited all 9 properties in 30007 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6830 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6823 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6883 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6791 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6894 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6722 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6822 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6906 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6745 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-22 08:02:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[403, 403, 403, 385, 385, 5, 385, 5, 385]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1500 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1501 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1398 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-22 08:09:11] [INFO ] Invariant cache hit.
[2023-03-22 08:09:29] [INFO ] Implicit Places using invariants in 17901 ms returned []
Implicit Place search using SMT only with invariants took 17903 ms to find 0 implicit places.
[2023-03-22 08:09:29] [INFO ] Invariant cache hit.
[2023-03-22 08:09:50] [INFO ] Dead Transitions using invariants and state equation in 20360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39672 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-22 08:09:50] [INFO ] Invariant cache hit.
Finished random walk after 819 steps, including 0 resets, run visited all 9 properties in 30030 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6805 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7014 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6772 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6908 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6756 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6815 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6745 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6960 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6871 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-22 08:11:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[436, 436, 436, 385, 385, 5, 385, 5, 385]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1234 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1234 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1234 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-22 08:18:10] [INFO ] Invariant cache hit.
[2023-03-22 08:18:30] [INFO ] Implicit Places using invariants in 20415 ms returned []
Implicit Place search using SMT only with invariants took 20425 ms to find 0 implicit places.
[2023-03-22 08:18:30] [INFO ] Invariant cache hit.
[2023-03-22 08:18:50] [INFO ] Dead Transitions using invariants and state equation in 19584 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41248 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-22 08:18:50] [INFO ] Invariant cache hit.
Finished random walk after 809 steps, including 0 resets, run visited all 9 properties in 30033 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7229 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6971 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6884 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6924 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6946 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6972 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6969 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6938 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6919 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-22 08:20:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[436, 436, 436, 413, 413, 5, 413, 5, 413]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1364 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1364 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1434 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-22 08:27:12] [INFO ] Invariant cache hit.
[2023-03-22 08:27:31] [INFO ] Implicit Places using invariants in 18827 ms returned []
Implicit Place search using SMT only with invariants took 18845 ms to find 0 implicit places.
[2023-03-22 08:27:31] [INFO ] Invariant cache hit.
[2023-03-22 08:27:49] [INFO ] Dead Transitions using invariants and state equation in 18842 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39130 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-22 08:27:50] [INFO ] Invariant cache hit.
Finished random walk after 817 steps, including 0 resets, run visited all 9 properties in 30005 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7043 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6845 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6832 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6906 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6887 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6793 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6895 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6489 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6841 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-22 08:29:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[436, 436, 436, 413, 413, 6, 413, 6, 413]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1203 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1203 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1309 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-22 08:36:10] [INFO ] Invariant cache hit.
[2023-03-22 08:36:28] [INFO ] Implicit Places using invariants in 17939 ms returned []
Implicit Place search using SMT only with invariants took 17951 ms to find 0 implicit places.
[2023-03-22 08:36:28] [INFO ] Invariant cache hit.
[2023-03-22 08:36:48] [INFO ] Dead Transitions using invariants and state equation in 20448 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39715 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-22 08:36:48] [INFO ] Invariant cache hit.
Finished random walk after 930 steps, including 0 resets, run visited all 9 properties in 30006 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6950 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6877 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6935 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7035 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6932 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6953 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7015 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6996 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6896 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-22 08:38:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after SMT) : [50000, 50000, 50000, 50000, 50000, 25000, 50000, 25000, 50000] Max seen :[445, 445, 445, 474, 474, 6, 474, 6, 474]
Support contains 150000 out of 250000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1264 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1265 ms. Remains : 250000/250000 places, 250000/250000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250000/250000 places, 250000/250000 transitions.
Applied a total of 0 rules in 1124 ms. Remains 250000 /250000 variables (removed 0) and now considering 250000/250000 (removed 0) transitions.
[2023-03-22 08:45:09] [INFO ] Invariant cache hit.
[2023-03-22 08:45:27] [INFO ] Implicit Places using invariants in 17712 ms returned []
Implicit Place search using SMT only with invariants took 17722 ms to find 0 implicit places.
[2023-03-22 08:45:27] [INFO ] Invariant cache hit.
[2023-03-22 08:45:45] [INFO ] Dead Transitions using invariants and state equation in 17911 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36782 ms. Remains : 250000/250000 places, 250000/250000 transitions.
[2023-03-22 08:45:45] [INFO ] Invariant cache hit.
Finished random walk after 911 steps, including 0 resets, run visited all 9 properties in 30028 ms. (steps per millisecond=0 )
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7088 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7166 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7274 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7228 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7142 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7093 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7144 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 6996 ms. (steps per millisecond=0 ) properties seen 3
Interrupted Best-First random walk after 2001 steps, including 0 resets, run timeout after 7029 ms. (steps per millisecond=0 ) properties seen 3
[2023-03-22 08:47:20] [INFO ] Invariant cache hit.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11006724 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100824 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="Philosophers-COL-050000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is Philosophers-COL-050000, 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 r298-tall-167873951400173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-050000.tgz
mv Philosophers-COL-050000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;