fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950100177
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Philosophers-COL-100000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16210.344 3600000.00 5465905.00 84217.40 ????F???F??F???? normal

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.r297-tall-167873950100177.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 ltsminxred
Input is Philosophers-COL-100000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950100177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.8M
-rw-r--r-- 1 mcc users 4.6K Feb 25 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 25 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 13:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 13:07 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 4.5M 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-00
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-01
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-02
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-03
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-04
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-05
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-06
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-07
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-08
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-09
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-10
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-11
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-12
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-13
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-14
FORMULA_NAME Philosophers-COL-100000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679463032340

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-100000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:30:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 05:30:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:30:34] [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 05:30:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 05:30:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1144 ms
[2023-03-22 05:30:35] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 500000 PT places and 500000.0 transition bindings in 44 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
[2023-03-22 05:30:35] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 05:30:35] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-100000-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-100000-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-100000-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 100001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=2173 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 37) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 05:30:36] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-22 05:30:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 05:30:36] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:18
[2023-03-22 05:30:36] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :3 real:18
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 05:30:36] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:19
[2023-03-22 05:30:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 05:30:36] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :21
[2023-03-22 05:30:36] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :21
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 05:30:36] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :21
Fused 22 Parikh solutions to 21 different solutions.
Finished Parikh walk after 199988 steps, including 1 resets, run visited all 1 properties in 384 ms. (steps per millisecond=520 )
Parikh walk visited 21 properties in 8245 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-22 05:30:44] [INFO ] Flatten gal took : 15 ms
[2023-03-22 05:30:44] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 100000) 100000) 100000)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 05:30:46] [INFO ] Unfolded HLPN to a Petri net with 500000 places and 500000 transitions 1600000 arcs in 1914 ms.
[2023-03-22 05:30:47] [INFO ] Unfolded 13 HLPN properties in 129 ms.
Support contains 500000 out of 500000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 2875 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
// Phase 1: matrix 500000 rows 500000 cols
[2023-03-22 05:31:00] [INFO ] Computed 200000 place invariants in 2898 ms
[2023-03-22 05:31:47] [INFO ] Implicit Places using invariants in 50147 ms returned []
Implicit Place search using SMT only with invariants took 50154 ms to find 0 implicit places.
[2023-03-22 05:31:48] [INFO ] Invariant cache hit.
[2023-03-22 05:32:33] [INFO ] Dead Transitions using invariants and state equation in 45836 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98916 ms. Remains : 500000/500000 places, 500000/500000 transitions.
Support contains 500000 out of 500000 places after structural reductions.
[2023-03-22 05:32:57] [INFO ] Flatten gal took : 16053 ms
[2023-03-22 05:33:49] [INFO ] Flatten gal took : 16011 ms
[2023-03-22 05:34:56] [INFO ] Input system was already deterministic with 500000 transitions.
Interrupted random walk after 271 steps, including 0 resets, run timeout after 30053 ms. (steps per millisecond=0 ) properties seen 12
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 8507 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11253 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7928 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11176 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15692 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15755 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16144 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11002 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11078 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16012 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7926 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15788 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11316 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 13192 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11053 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11064 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16401 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 17720 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24753 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11481 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15833 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 7770 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 21087 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 10945 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 12476 ms. (steps per millisecond=0 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-22 05:41:10] [INFO ] Invariant cache hit.
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:609)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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 05:41:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 05:41:37] [INFO ] After 26014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 500000 out of 500000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 4035 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4048 ms. Remains : 500000/500000 places, 500000/500000 transitions.
[2023-03-22 05:42:23] [INFO ] Flatten gal took : 22216 ms
[2023-03-22 05:43:15] [INFO ] Flatten gal took : 16318 ms
[2023-03-22 05:45:17] [INFO ] Input system was already deterministic with 500000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
Applied a total of 0 rules in 23760 ms. Remains 500000 /500000 variables (removed 0) and now considering 500000/500000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23787 ms. Remains : 500000/500000 places, 500000/500000 transitions.
[2023-03-22 05:46:14] [INFO ] Flatten gal took : 20647 ms
[2023-03-22 05:46:27] [INFO ] Flatten gal took : 13446 ms
[2023-03-22 05:47:17] [INFO ] Input system was already deterministic with 500000 transitions.
Interrupted random walk after 659 steps, including 0 resets, run timeout after 30034 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 1001 steps, including 0 resets, run timeout after 8289 ms. (steps per millisecond=0 ) properties seen 0
Probabilistic random walk after 8999 steps, saw 9001 distinct states, run finished after 119718 ms. (steps per millisecond=0 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:50:08] [INFO ] Invariant cache hit.
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:609)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:669)
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 05:50:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 05:50:33] [INFO ] After 25062ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 24 ms.
Support contains 100000 out of 500000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500000/500000 places, 500000/500000 transitions.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8726184 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16186544 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 CTLCardinality -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-100000"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Philosophers-COL-100000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950100177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-100000.tgz
mv Philosophers-COL-100000 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;