About the Execution of ITS-Tools for Sudoku-COL-BN16
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532600565.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Sudoku-COL-BN16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532600565
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.6K Apr 12 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 14:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 14:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 446K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-00
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-01
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-02
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-03
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-04
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-05
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-06
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-07
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-08
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-09
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-10
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-11
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-12
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-13
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-14
FORMULA_NAME Sudoku-COL-BN16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717045705172
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-30 05:08:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 05:08:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 05:08:26] [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.
[2024-05-30 05:08:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 05:08:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 693 ms
[2024-05-30 05:08:27] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5120 PT places and 65536.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2024-05-30 05:08:27] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 3 ms.
[2024-05-30 05:08:27] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 5 cols
[2024-05-30 05:08:27] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[256, 256, 256, 256, 0] Max Struct:[256, 256, 256, 256, 256]
FORMULA Sudoku-COL-BN16-UpperBounds-13 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-04 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-05 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-06 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-10 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-02 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-03 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-08 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-12 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-14 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-01 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-07 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-09 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-11 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-BN16-UpperBounds-00 256 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 05:08:27] [INFO ] Invariant cache hit.
[2024-05-30 05:08:27] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-30 05:08:27] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-30 05:08:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-30 05:08:27] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[256]
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2024-05-30 05:08:27] [INFO ] Unfolded HLPN to a Petri net with 5120 places and 4096 transitions 20480 arcs in 225 ms.
[2024-05-30 05:08:27] [INFO ] Unfolded 1 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[256]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[256]
// Phase 1: matrix 4096 rows 5120 cols
[2024-05-30 05:08:27] [INFO ] Computed 1024 invariants in 80 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[256]
RANDOM walk for 10000 steps (47 resets) in 4401 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 971 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[216] Max Struct:[256]
[2024-05-30 05:08:33] [INFO ] Invariant cache hit.
[2024-05-30 05:08:34] [INFO ] [Real]Absence check using 1024 positive place invariants in 856 ms returned sat
[2024-05-30 05:08:38] [INFO ] [Real]Absence check using state equation in 3557 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[216] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[216] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 320 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 05:08:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[216] Max Struct:[256]
RANDOM walk for 69985 steps (331 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 55622 steps (0 resets) in 5099 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[220] Max Struct:[256]
[2024-05-30 05:09:13] [INFO ] Invariant cache hit.
[2024-05-30 05:09:17] [INFO ] [Real]Absence check using 1024 positive place invariants in 3134 ms returned sat
[2024-05-30 05:09:36] [INFO ] [Real]Absence check using state equation in 19373 ms returned sat
[2024-05-30 05:09:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 181 ms.
[2024-05-30 05:09:37] [INFO ] Added : 0 causal constraints over 0 iterations in 569 ms. Result :sat
Minimization took 4784 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[220] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[220] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 295 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 122 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 05:09:42] [INFO ] Invariant cache hit.
[2024-05-30 05:09:50] [INFO ] Implicit Places using invariants in 7242 ms returned []
[2024-05-30 05:09:50] [INFO ] Invariant cache hit.
[2024-05-30 05:10:30] [INFO ] Implicit Places using invariants and state equation in 39816 ms returned []
Implicit Place search using SMT with State Equation took 47072 ms to find 0 implicit places.
[2024-05-30 05:10:30] [INFO ] Redundant transitions in 246 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47456 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 05:10:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[220] Max Struct:[256]
RANDOM walk for 69851 steps (331 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 53566 steps (0 resets) in 5031 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[220] Max Struct:[256]
[2024-05-30 05:11:05] [INFO ] Invariant cache hit.
[2024-05-30 05:11:09] [INFO ] [Real]Absence check using 1024 positive place invariants in 3302 ms returned sat
[2024-05-30 05:11:30] [INFO ] [Real]Absence check using state equation in 21116 ms returned sat
[2024-05-30 05:11:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 155 ms.
[2024-05-30 05:11:31] [INFO ] Added : 0 causal constraints over 0 iterations in 502 ms. Result :sat
Minimization took 4804 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[220] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[220] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 281 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 114 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 05:11:36] [INFO ] Invariant cache hit.
[2024-05-30 05:11:43] [INFO ] Implicit Places using invariants in 7180 ms returned []
[2024-05-30 05:11:43] [INFO ] Invariant cache hit.
[2024-05-30 05:12:23] [INFO ] Implicit Places using invariants and state equation in 40061 ms returned []
Implicit Place search using SMT with State Equation took 47255 ms to find 0 implicit places.
[2024-05-30 05:12:23] [INFO ] Redundant transitions in 154 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47549 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 05:12:25] [INFO ] Flatten gal took : 968 ms
[2024-05-30 05:12:25] [INFO ] Flatten gal took : 615 ms
[2024-05-30 05:12:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17362826416580379990.gal : 196 ms
[2024-05-30 05:12:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12509795110177066655.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17362826416580379990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12509795110177066655.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12509795110177066655.prop.
RANDOM walk for 40000 steps (188 resets) in 36985 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8584 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6858 ms. (5 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2024-05-30 05:13:16] [INFO ] Flatten gal took : 217 ms
[2024-05-30 05:13:16] [INFO ] Applying decomposition
[2024-05-30 05:13:16] [INFO ] Flatten gal took : 227 ms
Interrupted probabilistic random walk after 350790 steps, run timeout after 42074 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 350790 steps, saw 350664 distinct states, run finished after 42078 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-30 05:13:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3121 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2594 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6897ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 129 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 5120/5120 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 26646 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4759 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4589 ms. (8 steps per ms) remains 2/2 properties
[2024-05-30 05:13:38] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6798366504099358516.txt' '-o' '/tmp/graph6798366504099358516.bin' '-w' '/tmp/graph6798366504099358516.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:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:71)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 05:13:39] [INFO ] Flatten gal took : 224 ms
[2024-05-30 05:13:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14783278251419495390.gal : 38 ms
[2024-05-30 05:13:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11238388691526539141.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14783278251419495390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11238388691526539141.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11238388691526539141.prop.
Probabilistic random walk after 239275 steps, saw 239204 distinct states, run finished after 27054 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-30 05:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1024/5120 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5120 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9216/9216 variables, and 6144 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45063 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 5120/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1024/5120 variables, 1024/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5120 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9216/9216 variables, and 6144 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45055 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 5120/5120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 90812ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 137 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 122 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 05:15:34] [INFO ] Invariant cache hit.
[2024-05-30 05:15:41] [INFO ] Implicit Places using invariants in 7281 ms returned []
[2024-05-30 05:15:41] [INFO ] Invariant cache hit.
[2024-05-30 05:16:22] [INFO ] Implicit Places using invariants and state equation in 40531 ms returned []
Implicit Place search using SMT with State Equation took 47815 ms to find 0 implicit places.
[2024-05-30 05:16:22] [INFO ] Redundant transitions in 245 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48190 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[220] Max Struct:[256]
Starting property specific reduction for Sudoku-COL-BN16-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[256]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[256]
[2024-05-30 05:16:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[256]
RANDOM walk for 10000 steps (47 resets) in 4564 ms. (2 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 1019 ms. (9 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[217] Max Struct:[256]
[2024-05-30 05:16:28] [INFO ] Invariant cache hit.
[2024-05-30 05:16:30] [INFO ] [Real]Absence check using 1024 positive place invariants in 1469 ms returned sat
[2024-05-30 05:16:33] [INFO ] [Real]Absence check using state equation in 3081 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[217] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[217] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 118 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 05:16:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[217] Max Struct:[256]
RANDOM walk for 67059 steps (318 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 52086 steps (0 resets) in 5012 ms. (10 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[220] Max Struct:[256]
[2024-05-30 05:17:08] [INFO ] Invariant cache hit.
[2024-05-30 05:17:12] [INFO ] [Real]Absence check using 1024 positive place invariants in 3436 ms returned sat
[2024-05-30 05:17:32] [INFO ] [Real]Absence check using state equation in 20102 ms returned sat
[2024-05-30 05:17:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 334 ms.
[2024-05-30 05:17:33] [INFO ] Added : 0 causal constraints over 0 iterations in 675 ms. Result :sat
Minimization took 4785 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[220] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[220] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 115 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 108 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 05:17:38] [INFO ] Invariant cache hit.
[2024-05-30 05:17:45] [INFO ] Implicit Places using invariants in 7252 ms returned []
[2024-05-30 05:17:45] [INFO ] Invariant cache hit.
[2024-05-30 05:18:25] [INFO ] Implicit Places using invariants and state equation in 40067 ms returned []
Implicit Place search using SMT with State Equation took 47345 ms to find 0 implicit places.
[2024-05-30 05:18:26] [INFO ] Redundant transitions in 158 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47621 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 05:18:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[220] Max Struct:[256]
RANDOM walk for 66961 steps (317 resets) in 30001 ms. (2 steps per ms)
BEST_FIRST walk for 58853 steps (0 resets) in 5083 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[220] Max Struct:[256]
[2024-05-30 05:19:01] [INFO ] Invariant cache hit.
[2024-05-30 05:19:04] [INFO ] [Real]Absence check using 1024 positive place invariants in 3118 ms returned sat
[2024-05-30 05:19:24] [INFO ] [Real]Absence check using state equation in 19663 ms returned sat
[2024-05-30 05:19:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 150 ms.
[2024-05-30 05:19:25] [INFO ] Added : 0 causal constraints over 0 iterations in 475 ms. Result :sat
Minimization took 4785 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[220] Max Struct:[256]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[220] Max Struct:[256]
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 104 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 98 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 05:19:30] [INFO ] Invariant cache hit.
[2024-05-30 05:19:37] [INFO ] Implicit Places using invariants in 6932 ms returned []
[2024-05-30 05:19:37] [INFO ] Invariant cache hit.
[2024-05-30 05:20:15] [INFO ] Implicit Places using invariants and state equation in 38382 ms returned []
Implicit Place search using SMT with State Equation took 45318 ms to find 0 implicit places.
[2024-05-30 05:20:15] [INFO ] Redundant transitions in 156 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45587 ms. Remains : 5120/5120 places, 4096/4096 transitions.
[2024-05-30 05:20:16] [INFO ] Flatten gal took : 400 ms
[2024-05-30 05:20:16] [INFO ] Flatten gal took : 482 ms
[2024-05-30 05:20:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12398638980988733690.gal : 208 ms
[2024-05-30 05:20:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9351779965054790486.prop : 61 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12398638980988733690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9351779965054790486.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9351779965054790486.prop.
RANDOM walk for 40000 steps (188 resets) in 33264 ms. (1 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5288 ms. (7 steps per ms) remains 1/1 properties
[2024-05-30 05:20:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3641ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 112 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 5120/5120 places, 4096/4096 transitions.
RANDOM walk for 40000 steps (188 resets) in 21941 ms. (1 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4698 ms. (8 steps per ms) remains 1/1 properties
Probabilistic random walk after 201673 steps, saw 201614 distinct states, run finished after 18046 ms. (steps per millisecond=11 ) properties seen :0
[2024-05-30 05:20:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9784 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4096 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Detected timeout of ITS tools.
[2024-05-30 05:21:07] [INFO ] Flatten gal took : 184 ms
[2024-05-30 05:21:07] [INFO ] Applying decomposition
[2024-05-30 05:21:07] [INFO ] Flatten gal took : 186 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5120/9216 variables, and 1024 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9716 ms.
Refiners :[Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 19757ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 108 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 105 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 05:21:14] [INFO ] Invariant cache hit.
[2024-05-30 05:21:22] [INFO ] Implicit Places using invariants in 7862 ms returned []
[2024-05-30 05:21:22] [INFO ] Invariant cache hit.
[2024-05-30 05:21:25] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph203627695518183911.txt' '-o' '/tmp/graph203627695518183911.bin' '-w' '/tmp/graph203627695518183911.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:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:71)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 05:21:25] [INFO ] Flatten gal took : 214 ms
[2024-05-30 05:21:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1703300760872947463.gal : 33 ms
[2024-05-30 05:21:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17351005834431843354.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1703300760872947463.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17351005834431843354.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17351005834431843354.prop.
[2024-05-30 05:22:03] [INFO ] Implicit Places using invariants and state equation in 40487 ms returned []
Implicit Place search using SMT with State Equation took 48359 ms to find 0 implicit places.
[2024-05-30 05:22:03] [INFO ] Redundant transitions in 162 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48635 ms. Remains : 5120/5120 places, 4096/4096 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[220] Max Struct:[256]
Ending property specific reduction for Sudoku-COL-BN16-UpperBounds-15 in 340560 ms.
[2024-05-30 05:22:03] [INFO ] Flatten gal took : 192 ms
[2024-05-30 05:22:03] [INFO ] Applying decomposition
[2024-05-30 05:22:03] [INFO ] Flatten gal took : 196 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1680035911682016145.txt' '-o' '/tmp/graph1680035911682016145.bin' '-w' '/tmp/graph1680035911682016145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1680035911682016145.bin' '-l' '-1' '-v' '-w' '/tmp/graph1680035911682016145.weights' '-q' '0' '-e' '0.001'
[2024-05-30 05:22:04] [INFO ] Decomposing Gal with order
[2024-05-30 05:22:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 05:22:05] [INFO ] Removed a total of 11220 redundant transitions.
[2024-05-30 05:22:06] [INFO ] Flatten gal took : 662 ms
[2024-05-30 05:22:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 87 ms.
[2024-05-30 05:22:07] [INFO ] Time to serialize gal into /tmp/UpperBounds2241775718438213693.gal : 59 ms
[2024-05-30 05:22:07] [INFO ] Time to serialize properties into /tmp/UpperBounds1572842352847003673.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2241775718438213693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1572842352847003673.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds1572842352847003673.prop.
BK_STOP 1717046729413
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-BN16"
export BK_EXAMINATION="UpperBounds"
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-5568"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-BN16, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532600565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN16.tgz
mv Sudoku-COL-BN16 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;