fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r258-tall-165303545500310
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Sudoku-PT-AN14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1833131.00 0.00 0.00 FTT?TTFFFTTTTTFT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545500310.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-AN14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545500310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 66M
-rw-r--r-- 1 mcc users 675K Apr 30 12:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Apr 30 12:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2M Apr 30 11:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 30 11:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 420K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.2M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Apr 30 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Apr 30 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8M Apr 30 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28M Apr 30 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 96K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 235K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:34 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-PT-AN14-ReachabilityCardinality-00
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-01
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-02
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-03
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-04
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-05
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-06
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-07
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-08
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-09
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-10
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-11
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-12
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-13
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-14
FORMULA_NAME Sudoku-PT-AN14-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654270445322

Running Version 202205111006
[2022-06-03 15:34:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 15:34:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:34:06] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2022-06-03 15:34:06] [INFO ] Transformed 3332 places.
[2022-06-03 15:34:06] [INFO ] Transformed 2744 transitions.
[2022-06-03 15:34:06] [INFO ] Parsed PT model containing 3332 places and 2744 transitions in 369 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 1022 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 58 resets, run finished after 4586 ms. (steps per millisecond=2 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 804 ms. (steps per millisecond=1 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 288 ms. (steps per millisecond=3 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Probabilistic random walk after 112083 steps, saw 112030 distinct states, run finished after 15014 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:34:29] [INFO ] Computed 588 place invariants in 58 ms
[2022-06-03 15:34:37] [INFO ] [Real]Absence check using 588 positive place invariants in 202 ms returned sat
[2022-06-03 15:34:41] [INFO ] After 5706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-06-03 15:34:42] [INFO ] [Nat]Absence check using 588 positive place invariants in 166 ms returned sat
[2022-06-03 15:35:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 15:35:06] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 61 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3332/3332 places, 2744/2744 transitions.
Interrupted random walk after 58854 steps, including 341 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen 1
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 162660 steps, including 1 resets, run timeout after 5002 ms. (steps per millisecond=32 ) properties seen 0
Interrupted Best-First random walk after 17889 steps, including 0 resets, run timeout after 5103 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 444418 steps, including 3 resets, run timeout after 5004 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 439487 steps, including 3 resets, run timeout after 5005 ms. (steps per millisecond=87 ) properties seen 0
Running SMT prover for 4 properties.
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:35:56] [INFO ] Computed 588 place invariants in 23 ms
[2022-06-03 15:35:58] [INFO ] [Real]Absence check using 588 positive place invariants in 162 ms returned sat
[2022-06-03 15:36:04] [INFO ] After 7221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-03 15:36:05] [INFO ] [Nat]Absence check using 588 positive place invariants in 148 ms returned sat
[2022-06-03 15:36:28] [INFO ] After 2141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 15:36:29] [INFO ] After 2520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 256 ms.
[2022-06-03 15:36:29] [INFO ] After 24591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 4 Parikh solutions to 2 different solutions.
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-AN14-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 4257 ms.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 37 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3332/3332 places, 2744/2744 transitions.
Interrupted random walk after 80102 steps, including 464 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 17881 steps, including 0 resets, run timeout after 5169 ms. (steps per millisecond=3 ) properties seen 0
Interrupted probabilistic random walk after 1493593 steps, run timeout after 105001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 1493593 steps, saw 505364 distinct states, run finished after 105004 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:38:53] [INFO ] Computed 588 place invariants in 16 ms
[2022-06-03 15:38:55] [INFO ] [Real]Absence check using 588 positive place invariants in 158 ms returned sat
[2022-06-03 15:38:59] [INFO ] After 5310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:39:00] [INFO ] [Nat]Absence check using 588 positive place invariants in 151 ms returned sat
[2022-06-03 15:39:09] [INFO ] After 9920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 45 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 27 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:39:09] [INFO ] Computed 588 place invariants in 11 ms
[2022-06-03 15:39:10] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:39:10] [INFO ] Computed 588 place invariants in 9 ms
[2022-06-03 15:39:12] [INFO ] Implicit Places using invariants and state equation in 1948 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
[2022-06-03 15:39:12] [INFO ] Redundant transitions in 160 ms returned []
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:39:12] [INFO ] Computed 588 place invariants in 11 ms
[2022-06-03 15:39:14] [INFO ] Dead Transitions using invariants and state equation in 1841 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3332/3332 places, 2744/2744 transitions.
Interrupted random walk after 81528 steps, including 472 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 18397 steps, including 0 resets, run timeout after 5144 ms. (steps per millisecond=3 ) properties seen 0
Interrupted probabilistic random walk after 1517518 steps, run timeout after 105001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 1517518 steps, saw 510015 distinct states, run finished after 105001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:41:34] [INFO ] Computed 588 place invariants in 16 ms
[2022-06-03 15:41:36] [INFO ] [Real]Absence check using 588 positive place invariants in 173 ms returned sat
[2022-06-03 15:41:41] [INFO ] After 5895ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:41:42] [INFO ] [Nat]Absence check using 588 positive place invariants in 161 ms returned sat
[2022-06-03 15:41:51] [INFO ] After 9688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 27 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 22 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:41:51] [INFO ] Computed 588 place invariants in 12 ms
[2022-06-03 15:41:51] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:41:51] [INFO ] Computed 588 place invariants in 11 ms
[2022-06-03 15:41:52] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2022-06-03 15:41:52] [INFO ] Redundant transitions in 164 ms returned []
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:41:52] [INFO ] Computed 588 place invariants in 12 ms
[2022-06-03 15:41:54] [INFO ] Dead Transitions using invariants and state equation in 1784 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 22 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:41:54] [INFO ] Computed 588 place invariants in 8 ms
[2022-06-03 15:41:56] [INFO ] [Real]Absence check using 588 positive place invariants in 155 ms returned sat
[2022-06-03 15:42:01] [INFO ] After 5620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:42:01] [INFO ] [Nat]Absence check using 588 positive place invariants in 157 ms returned sat
[2022-06-03 15:42:10] [INFO ] After 9602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-06-03 15:42:11] [INFO ] Flatten gal took : 287 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4879682599006030097
[2022-06-03 15:42:11] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2022-06-03 15:42:11] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4879682599006030097
Running compilation step : cd /tmp/ltsmin4879682599006030097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-03 15:42:11] [INFO ] Applying decomposition
[2022-06-03 15:42:11] [INFO ] Flatten gal took : 362 ms
[2022-06-03 15:42:12] [INFO ] Flatten gal took : 228 ms
[2022-06-03 15:42:12] [INFO ] Input system was already deterministic with 2744 transitions.
[2022-06-03 15:42:14] [INFO ] Ran tautology test, simplified 0 / 1 in 2612 ms.
[2022-06-03 15:42:15] [INFO ] BMC solution for property Sudoku-PT-AN14-ReachabilityCardinality-03(UNSAT) depth K=0 took 111 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 2744 rows 3332 cols
[2022-06-03 15:42:15] [INFO ] Computed 588 place invariants in 19 ms
[2022-06-03 15:42:15] [INFO ] Computed 588 place invariants in 21 ms
[2022-06-03 15:42:20] [INFO ] Proved 3332 variables to be positive in 4490 ms
Compilation finished in 10403 ms.
Running link step : cd /tmp/ltsmin4879682599006030097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4879682599006030097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'SudokuPTAN14ReachabilityCardinality03==true'
[2022-06-03 15:42:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSudoku-PT-AN14-ReachabilityCardinality-03
[2022-06-03 15:42:25] [INFO ] KInduction solution for property Sudoku-PT-AN14-ReachabilityCardinality-03(SAT) depth K=0 took 5251 ms
[2022-06-03 15:42:36] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11527897281536258657.txt' '-o' '/tmp/graph11527897281536258657.bin' '-w' '/tmp/graph11527897281536258657.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:98)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:957)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2022-06-03 15:42:36] [INFO ] Flatten gal took : 534 ms
[2022-06-03 15:42:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14824483833579112647.gal : 73 ms
[2022-06-03 15:42:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15127837720777101126.prop : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14824483833579112647.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15127837720777101126.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15127837720777101126.prop.
[2022-06-03 15:43:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesSudoku-PT-AN14-ReachabilityCardinality-03
[2022-06-03 15:43:29] [INFO ] KInduction solution for property Sudoku-PT-AN14-ReachabilityCardinality-03(SAT) depth K=1 took 63893 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 501

BK_STOP 1654272278453

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-PT-AN14"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN14, 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 r258-tall-165303545500310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN14.tgz
mv Sudoku-PT-AN14 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;