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.r265-smll-167863540200575.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 Peterson-COL-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540200575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.5K Feb 25 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 22:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K 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 Peterson-COL-4-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679100787255

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 00:53:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 00:53:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 00:53:10] [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-18 00:53:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 00:53:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 774 ms
[2023-03-18 00:53:11] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 00:53:11] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2023-03-18 00:53:11] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 3 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 211 steps, including 0 resets, run visited all 7 properties in 21 ms. (steps per millisecond=10 )
[2023-03-18 00:53:11] [INFO ] Flatten gal took : 16 ms
[2023-03-18 00:53:11] [INFO ] Flatten gal took : 4 ms
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-18 00:53:11] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 42 ms.
[2023-03-18 00:53:11] [INFO ] Unfolded 15 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 40 transitions.
FORMULA Peterson-COL-4-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 12) seen :9
FORMULA Peterson-COL-4-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1081 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 00:53:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 00:53:13] [INFO ] Computed 19 place invariants in 21 ms
[2023-03-18 00:53:15] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-18 00:53:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-18 00:53:15] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 00:53:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 00:53:16] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2023-03-18 00:53:25] [INFO ] After 8911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 00:53:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:53:33] [INFO ] After 7851ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 00:53:34] [INFO ] Deduced a trap composed of 13 places in 340 ms of which 12 ms to minimize.
[2023-03-18 00:53:35] [INFO ] Deduced a trap composed of 72 places in 355 ms of which 7 ms to minimize.
[2023-03-18 00:53:35] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 1 ms to minimize.
[2023-03-18 00:53:35] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 2 ms to minimize.
[2023-03-18 00:53:36] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 1 ms to minimize.
[2023-03-18 00:53:36] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 1 ms to minimize.
[2023-03-18 00:53:36] [INFO ] Deduced a trap composed of 91 places in 279 ms of which 1 ms to minimize.
[2023-03-18 00:53:36] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 2 ms to minimize.
[2023-03-18 00:53:37] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2023-03-18 00:53:37] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 1 ms to minimize.
[2023-03-18 00:53:37] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2023-03-18 00:53:37] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 1 ms to minimize.
[2023-03-18 00:53:38] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 13 ms to minimize.
[2023-03-18 00:53:38] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 1 ms to minimize.
[2023-03-18 00:53:38] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 1 ms to minimize.
[2023-03-18 00:53:38] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 1 ms to minimize.
[2023-03-18 00:53:39] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 1 ms to minimize.
[2023-03-18 00:53:39] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 1 ms to minimize.
[2023-03-18 00:53:39] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 0 ms to minimize.
[2023-03-18 00:53:40] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 1 ms to minimize.
[2023-03-18 00:53:40] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 0 ms to minimize.
[2023-03-18 00:53:40] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 1 ms to minimize.
[2023-03-18 00:53:40] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 1 ms to minimize.
[2023-03-18 00:53:40] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 6600 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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:902)
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-18 00:53:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 00:53:40] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 68 ms.
Support contains 460 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 36 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 480/480 places, 690/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1070 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 306564 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306564 steps, saw 70003 distinct states, run finished after 3002 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 00:53:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:53:46] [INFO ] Invariant cache hit.
[2023-03-18 00:53:47] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 00:53:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 19 ms returned sat
[2023-03-18 00:53:47] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 00:53:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 00:53:48] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2023-03-18 00:53:56] [INFO ] After 8514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 00:53:56] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:54:04] [INFO ] After 7426ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 00:54:05] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 1 ms to minimize.
[2023-03-18 00:54:05] [INFO ] Deduced a trap composed of 42 places in 289 ms of which 1 ms to minimize.
[2023-03-18 00:54:06] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 0 ms to minimize.
[2023-03-18 00:54:06] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 1 ms to minimize.
[2023-03-18 00:54:06] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 1 ms to minimize.
[2023-03-18 00:54:06] [INFO ] Deduced a trap composed of 98 places in 183 ms of which 1 ms to minimize.
[2023-03-18 00:54:07] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 1 ms to minimize.
[2023-03-18 00:54:07] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 0 ms to minimize.
[2023-03-18 00:54:07] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2023-03-18 00:54:07] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 0 ms to minimize.
[2023-03-18 00:54:07] [INFO ] Deduced a trap composed of 94 places in 173 ms of which 1 ms to minimize.
[2023-03-18 00:54:08] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2023-03-18 00:54:08] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 1 ms to minimize.
[2023-03-18 00:54:08] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 1 ms to minimize.
[2023-03-18 00:54:08] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 1 ms to minimize.
[2023-03-18 00:54:09] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 0 ms to minimize.
[2023-03-18 00:54:09] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 2 ms to minimize.
[2023-03-18 00:54:09] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 1 ms to minimize.
[2023-03-18 00:54:09] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 0 ms to minimize.
[2023-03-18 00:54:10] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2023-03-18 00:54:10] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 1 ms to minimize.
[2023-03-18 00:54:10] [INFO ] Deduced a trap composed of 57 places in 250 ms of which 0 ms to minimize.
[2023-03-18 00:54:11] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 0 ms to minimize.
[2023-03-18 00:54:11] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 1 ms to minimize.
[2023-03-18 00:54:11] [INFO ] Deduced a trap composed of 56 places in 218 ms of which 1 ms to minimize.
[2023-03-18 00:54:11] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 1 ms to minimize.
[2023-03-18 00:54:12] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 1 ms to minimize.
[2023-03-18 00:54:12] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 1 ms to minimize.
[2023-03-18 00:54:12] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 0 ms to minimize.
[2023-03-18 00:54:13] [INFO ] Deduced a trap composed of 87 places in 207 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
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:902)
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-18 00:54:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 00:54:13] [INFO ] After 25176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 27 ms.
Support contains 460 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 19 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 480/480 places, 690/690 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 17 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:54:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:54:13] [INFO ] Invariant cache hit.
[2023-03-18 00:54:13] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-18 00:54:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:54:13] [INFO ] Invariant cache hit.
[2023-03-18 00:54:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:54:13] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-18 00:54:13] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-18 00:54:13] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:54:13] [INFO ] Invariant cache hit.
[2023-03-18 00:54:14] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1221 ms. Remains : 480/480 places, 690/690 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 480 transition count 630
Applied a total of 60 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 630/690 (removed 60) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 00:54:14] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-18 00:54:15] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-18 00:54:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2023-03-18 00:54:15] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 00:54:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-18 00:54:15] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-18 00:54:24] [INFO ] After 8490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 00:54:32] [INFO ] After 17007ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7606 ms.
[2023-03-18 00:54:40] [INFO ] After 24898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-18 00:54:40] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 23 ms.
[2023-03-18 00:54:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 18 ms.
[2023-03-18 00:54:40] [INFO ] Flatten gal took : 100 ms
Total runtime 90558 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/655/inv_0_ --invariant=/tmp/655/inv_1_ --invariant=/tmp/655/inv_2_ --inv-par
FORMULA Peterson-COL-4-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-4-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-COL-4-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679102656099

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name Peterson-COL-4-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/655/inv_0_
rfs formula name Peterson-COL-4-ReachabilityFireability-06
rfs formula type AG
rfs formula formula --invariant=/tmp/655/inv_1_
rfs formula name Peterson-COL-4-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/655/inv_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 480 places, 690 transitions and 2120 arcs
pnml2lts-sym: Petri net Peterson_COL_4_unf analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 690->670 groups
pnml2lts-sym: Regrouping took 0.330 real 0.330 user 0.010 sys
pnml2lts-sym: state vector length is 480; there are 670 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 60578055 group checks and 0 next state calls
pnml2lts-sym: reachability took 1772.090 real 7005.590 user 65.980 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.240 real 0.970 user 0.000 sys
pnml2lts-sym: state space has 629946518 states, 927218 nodes
pnml2lts-sym: group_next: 4348 nodes total
pnml2lts-sym: group_explored: 4398 nodes, 3270 short vectors total
pnml2lts-sym: max token count: 1

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="Peterson-COL-4"
export BK_EXAMINATION="ReachabilityFireability"
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 Peterson-COL-4, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540200575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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