About the Execution of LTSMin+red for Sudoku-COL-AN12
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3510.535 | 377882.00 | 448408.00 | 1179.90 | TTFT?T?FTFFTFTTT | 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.r489-tall-167912706300094.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 Sudoku-COL-AN12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706300094
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.4K Feb 26 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 08:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K 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 Sudoku-COL-AN12-ReachabilityCardinality-00
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-01
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-02
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-03
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-04
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-05
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-06
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-07
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-08
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-09
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-10
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-11
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-12
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-13
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-14
FORMULA_NAME Sudoku-COL-AN12-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679184856956
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 00:14:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 00:14:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:14:18] [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-19 00:14:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 00:14:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 536 ms
[2023-03-19 00:14:18] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2160 PT places and 1728.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 00:14:18] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-19 00:14:19] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
[2023-03-19 00:14:19] [INFO ] Flatten gal took : 12 ms
[2023-03-19 00:14:19] [INFO ] Flatten gal took : 2 ms
Domain [N(12), N(12)] of place Rows breaks symmetries in sort N
[2023-03-19 00:14:19] [INFO ] Unfolded HLPN to a Petri net with 2160 places and 1728 transitions 6912 arcs in 42 ms.
[2023-03-19 00:14:19] [INFO ] Unfolded 13 HLPN properties in 7 ms.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 2929 ms. (steps per millisecond=3 ) properties (out of 13) seen :7
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4421 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3562 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3688 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-19 00:14:35] [INFO ] Computed 432 place invariants in 33 ms
[2023-03-19 00:14:43] [INFO ] [Real]Absence check using 432 positive place invariants in 169 ms returned sat
[2023-03-19 00:14:43] [INFO ] After 1627ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:3
[2023-03-19 00:14:44] [INFO ] [Nat]Absence check using 432 positive place invariants in 107 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:621)
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-19 00:15:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:15:08] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:3
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 47 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 2466 ms. (steps per millisecond=4 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3594 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 234814 steps, run timeout after 18001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 234814 steps, saw 168264 distinct states, run finished after 18002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 00:15:33] [INFO ] Invariant cache hit.
[2023-03-19 00:15:36] [INFO ] [Real]Absence check using 432 positive place invariants in 121 ms returned sat
[2023-03-19 00:15:36] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 00:15:36] [INFO ] [Nat]Absence check using 432 positive place invariants in 147 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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-19 00:16:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:16:01] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:2
FORMULA Sudoku-COL-AN12-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 30 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 78 resets, run finished after 1727 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Probabilistic random walk after 128486 steps, saw 101032 distinct states, run finished after 6026 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 00:16:10] [INFO ] Invariant cache hit.
[2023-03-19 00:16:10] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:16:10] [INFO ] [Nat]Absence check using 432 positive place invariants in 108 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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-19 00:16:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:16:35] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 27 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 18 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:16:35] [INFO ] Invariant cache hit.
[2023-03-19 00:16:35] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-19 00:16:35] [INFO ] Invariant cache hit.
[2023-03-19 00:16:37] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2023-03-19 00:16:37] [INFO ] Redundant transitions in 103 ms returned []
[2023-03-19 00:16:37] [INFO ] Invariant cache hit.
[2023-03-19 00:16:38] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2440 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 18 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 00:16:38] [INFO ] Invariant cache hit.
[2023-03-19 00:16:38] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:16:38] [INFO ] [Nat]Absence check using 432 positive place invariants in 108 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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-19 00:20:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:20:23] [INFO ] After 225029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
[2023-03-19 00:20:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-19 00:20:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2160 places, 1728 transitions and 6912 arcs took 10 ms.
[2023-03-19 00:20:23] [INFO ] Flatten gal took : 182 ms
Total runtime 365587 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 --invariant=/tmp/564/inv_0_ --invariant=/tmp/564/inv_1_ --inv-par
Could not compute solution for formula : Sudoku-COL-AN12-ReachabilityCardinality-04
Could not compute solution for formula : Sudoku-COL-AN12-ReachabilityCardinality-06
BK_STOP 1679185234838
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name Sudoku-COL-AN12-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/564/inv_0_
rfs formula name Sudoku-COL-AN12-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/564/inv_1_
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 2160 places, 1728 transitions and 6912 arcs
pnml2lts-sym: Petri net Sudoku_COL_AN12_unf analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.020 user 0.010 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: 1728->1728 groups
pnml2lts-sym: Regrouping took 2.580 real 2.570 user 0.000 sys
pnml2lts-sym: state vector length is 2160; there are 1728 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: 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: got initial state
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="Sudoku-COL-AN12"
export BK_EXAMINATION="ReachabilityCardinality"
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 Sudoku-COL-AN12, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r489-tall-167912706300094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN12.tgz
mv Sudoku-COL-AN12 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;