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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16216.247 1748695.00 5400895.00 3215.20 ?TFTTFTFFTTTTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545600358.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-BN16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545600358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 77M
-rw-r--r-- 1 mcc users 912K Apr 30 12:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.8M Apr 30 12:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4M Apr 30 11:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 14M Apr 30 11:48 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 635K May 9 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.0M May 9 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3M May 9 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4M May 9 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3M Apr 30 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 10M Apr 30 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2M Apr 30 12:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22M Apr 30 12:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 200K May 9 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 481K May 9 09:13 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 2.7M 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-BN16-ReachabilityCardinality-00
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-01
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-02
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-03
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-04
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-05
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-06
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-07
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-08
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-09
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-10
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-11
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-12
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-13
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-14
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654270582108

Running Version 202205111006
[2022-06-03 15:36:23] [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:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 15:36:23] [INFO ] Load time of PNML (sax parser for PT used): 356 ms
[2022-06-03 15:36:23] [INFO ] Transformed 5120 places.
[2022-06-03 15:36:23] [INFO ] Transformed 4096 transitions.
[2022-06-03 15:36:23] [INFO ] Parsed PT model containing 5120 places and 4096 transitions in 499 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 2343 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 47 resets, run finished after 9841 ms. (steps per millisecond=1 ) properties (out of 16) seen :2
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4082 ms. (steps per millisecond=2 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Interrupted Best-First random walk after 4001 steps, including 0 resets, run timeout after 5842 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 6099 steps, including 1 resets, run timeout after 5152 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4811 ms. (steps per millisecond=2 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :1
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:36:58] [INFO ] Computed 1024 place invariants in 58 ms
[2022-06-03 15:37:16] [INFO ] After 2081ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2022-06-03 15:37:18] [INFO ] [Nat]Absence check using 1024 positive place invariants in 344 ms returned sat
[2022-06-03 15:37:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 15:37:41] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:12
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 5120 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 184 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Interrupted random walk after 30212 steps, including 143 resets, run timeout after 30001 ms. (steps per millisecond=1 ) properties seen 2
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 13127 steps, including 0 resets, run timeout after 5081 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 252740 steps, including 1 resets, run timeout after 5014 ms. (steps per millisecond=50 ) properties seen 0
Interrupted Best-First random walk after 151066 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=30 ) properties seen 0
Interrupted Best-First random walk after 7098 steps, including 0 resets, run timeout after 5790 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 11140 steps, including 0 resets, run timeout after 5164 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 258078 steps, including 1 resets, run timeout after 5020 ms. (steps per millisecond=51 ) properties seen 0
Interrupted Best-First random walk after 341812 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=68 ) properties seen 0
Interrupted Best-First random walk after 349680 steps, including 1 resets, run timeout after 5013 ms. (steps per millisecond=69 ) properties seen 1
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 379412 steps, including 1 resets, run timeout after 5005 ms. (steps per millisecond=75 ) properties seen 0
Interrupted Best-First random walk after 334155 steps, including 1 resets, run timeout after 5008 ms. (steps per millisecond=66 ) properties seen 0
Running SMT prover for 9 properties.
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:39:03] [INFO ] Computed 1024 place invariants in 31 ms
[2022-06-03 15:39:11] [INFO ] After 1317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-03 15:39:13] [INFO ] [Nat]Absence check using 1024 positive place invariants in 366 ms returned sat
[2022-06-03 15:40:04] [INFO ] After 11214ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2022-06-03 15:40:04] [INFO ] After 11572ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 181 ms.
[2022-06-03 15:40:05] [INFO ] After 53154ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 2 different solutions.
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 2667 ms.
Support contains 5120 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 48 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Interrupted random walk after 76593 steps, including 363 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 14127 steps, including 0 resets, run timeout after 5273 ms. (steps per millisecond=2 ) properties seen 0
Interrupted probabilistic random walk after 3085497 steps, run timeout after 105001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 3085497 steps, saw 920119 distinct states, run finished after 105006 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:42:28] [INFO ] Computed 1024 place invariants in 25 ms
[2022-06-03 15:42:31] [INFO ] After 1404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:42:32] [INFO ] [Nat]Absence check using 1024 positive place invariants in 377 ms returned sat
[2022-06-03 15:42:41] [INFO ] After 10091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5120 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 54 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 37 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:42:42] [INFO ] Computed 1024 place invariants in 17 ms
[2022-06-03 15:42:42] [INFO ] Implicit Places using invariants in 561 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:42:42] [INFO ] Computed 1024 place invariants in 26 ms
[2022-06-03 15:42:43] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2022-06-03 15:42:43] [INFO ] Redundant transitions in 256 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:42:43] [INFO ] Computed 1024 place invariants in 16 ms
[2022-06-03 15:42:46] [INFO ] Dead Transitions using invariants and state equation in 2784 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Interrupted random walk after 74894 steps, including 355 resets, run timeout after 30001 ms. (steps per millisecond=2 ) properties seen 0
Interrupted Best-First random walk after 13127 steps, including 0 resets, run timeout after 5058 ms. (steps per millisecond=2 ) properties seen 0
Interrupted probabilistic random walk after 3121552 steps, run timeout after 105001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 3121552 steps, saw 924672 distinct states, run finished after 105003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:45:06] [INFO ] Computed 1024 place invariants in 21 ms
[2022-06-03 15:45:08] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:45:09] [INFO ] [Nat]Absence check using 1024 positive place invariants in 403 ms returned sat
[2022-06-03 15:45:18] [INFO ] After 10061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 5120 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 43 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 36 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:45:18] [INFO ] Computed 1024 place invariants in 15 ms
[2022-06-03 15:45:19] [INFO ] Implicit Places using invariants in 817 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:45:19] [INFO ] Computed 1024 place invariants in 19 ms
[2022-06-03 15:45:20] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2022-06-03 15:45:20] [INFO ] Redundant transitions in 176 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:45:20] [INFO ] Computed 1024 place invariants in 22 ms
[2022-06-03 15:45:23] [INFO ] Dead Transitions using invariants and state equation in 3054 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 30 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:45:23] [INFO ] Computed 1024 place invariants in 23 ms
[2022-06-03 15:45:25] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 15:45:26] [INFO ] [Nat]Absence check using 1024 positive place invariants in 339 ms returned sat
[2022-06-03 15:45:35] [INFO ] After 9972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-06-03 15:45:36] [INFO ] Flatten gal took : 486 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9311273290001019618
[2022-06-03 15:45:36] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-06-03 15:45:37] [INFO ] Built C files in 220ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9311273290001019618
[2022-06-03 15:45:37] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin9311273290001019618;'/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:45:37] [INFO ] Flatten gal took : 744 ms
[2022-06-03 15:45:38] [INFO ] Flatten gal took : 814 ms
[2022-06-03 15:45:38] [INFO ] Input system was already deterministic with 4096 transitions.
[2022-06-03 15:45:42] [INFO ] Ran tautology test, simplified 0 / 1 in 4683 ms.
[2022-06-03 15:45:43] [INFO ] BMC solution for property Sudoku-PT-BN16-ReachabilityCardinality-00(UNSAT) depth K=0 took 569 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 4096 rows 5120 cols
[2022-06-03 15:45:44] [INFO ] Computed 1024 place invariants in 18 ms
[2022-06-03 15:45:44] [INFO ] Computed 1024 place invariants in 21 ms
[2022-06-03 15:45:53] [INFO ] Proved 5120 variables to be positive in 8781 ms
Compilation finished in 23391 ms.
Running link step : cd /tmp/ltsmin9311273290001019618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 558 ms.
Running LTSmin : cd /tmp/ltsmin9311273290001019618;'/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' 'SudokuPTBN16ReachabilityCardinality00==true'
[2022-06-03 15:46:09] [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/graph6733352607484431848.txt' '-o' '/tmp/graph6733352607484431848.bin' '-w' '/tmp/graph6733352607484431848.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:46:10] [INFO ] Flatten gal took : 665 ms
[2022-06-03 15:46:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10273230519259541409.gal : 181 ms
[2022-06-03 15:46:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13542572534716745959.prop : 25 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/ReachabilityCardinality10273230519259541409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13542572534716745959.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/ReachabilityCardinality13542572534716745959.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1045
SDD proceeding with computation,1 properties remain. new max is 8

BK_STOP 1654272330803

--------------------
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-BN16"
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-BN16, 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-165303545600358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN16.tgz
mv Sudoku-PT-BN16 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 ;