About the Execution of 2024-gold for Sudoku-COL-AN14
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r237-smll-174903502700054.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Sudoku-COL-AN14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-smll-174903502700054
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_pt
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 5 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 6.5K May 29 14:33 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN14-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749111397278
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-05 08:16:39] [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]
[2025-06-05 08:16:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 08:16:40] [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.
[2025-06-05 08:16:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 08:16:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1192 ms
[2025-06-05 08:16:41] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2025-06-05 08:16:41] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 22 ms.
[2025-06-05 08:16:41] [INFO ] Skeletonized 4 HLPN properties in 1 ms.
// Phase 1: matrix 1 rows 4 cols
[2025-06-05 08:16:41] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[196, 196, 0, 196] Max Struct:[196, 196, 196, 196]
FORMULA Sudoku-COL-AN14-UpperBounds-10 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-12 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-07 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-11 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-14 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-02 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-01 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-03 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-09 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-15 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN14-UpperBounds-00 196 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-05 08:16:41] [INFO ] Invariant cache hit.
[2025-06-05 08:16:41] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-05 08:16:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-05 08:16:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 08:16:41] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[196]
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2025-06-05 08:16:41] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 148 ms.
[2025-06-05 08:16:41] [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:[196]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[196]
// Phase 1: matrix 2744 rows 3332 cols
[2025-06-05 08:16:42] [INFO ] Computed 588 invariants in 97 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[196]
RANDOM walk for 10000 steps (58 resets) in 2922 ms. (3 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 810 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[177] Max Struct:[196]
[2025-06-05 08:16:45] [INFO ] Invariant cache hit.
[2025-06-05 08:16:48] [INFO ] [Real]Absence check using 588 positive place invariants in 1862 ms returned sat
[2025-06-05 08:16:50] [INFO ] [Real]Absence check using state equation in 2128 ms returned sat
[2025-06-05 08:16:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 08:16:53] [INFO ] [Nat]Absence check using 588 positive place invariants in 1996 ms returned sat
[2025-06-05 08:16:56] [INFO ] [Nat]Absence check using state equation in 2282 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[177] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[177] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 265 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2025-06-05 08:16:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[177] Max Struct:[196]
RANDOM walk for 113304 steps (657 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 58510 steps (0 resets) in 5017 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[182] Max Struct:[196]
[2025-06-05 08:17:31] [INFO ] Invariant cache hit.
[2025-06-05 08:17:34] [INFO ] [Real]Absence check using 588 positive place invariants in 2218 ms returned sat
[2025-06-05 08:17:53] [INFO ] [Real]Absence check using state equation in 19430 ms returned sat
[2025-06-05 08:17:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 225 ms.
[2025-06-05 08:17:54] [INFO ] Added : 0 causal constraints over 0 iterations in 607 ms. Result :sat
Minimization took 5374 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[182] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[182] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 93 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 208 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2025-06-05 08:18:00] [INFO ] Invariant cache hit.
[2025-06-05 08:18:03] [INFO ] Implicit Places using invariants in 3032 ms returned []
[2025-06-05 08:18:03] [INFO ] Invariant cache hit.
[2025-06-05 08:18:12] [INFO ] Implicit Places using invariants and state equation in 8555 ms returned []
Implicit Place search using SMT with State Equation took 11593 ms to find 0 implicit places.
[2025-06-05 08:18:12] [INFO ] Redundant transitions in 234 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12056 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2025-06-05 08:18:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[182] Max Struct:[196]
RANDOM walk for 119165 steps (691 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 56477 steps (0 resets) in 5020 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[182] Max Struct:[196]
[2025-06-05 08:18:47] [INFO ] Invariant cache hit.
[2025-06-05 08:18:49] [INFO ] [Real]Absence check using 588 positive place invariants in 1968 ms returned sat
[2025-06-05 08:19:07] [INFO ] [Real]Absence check using state equation in 17753 ms returned sat
[2025-06-05 08:19:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 171 ms.
[2025-06-05 08:19:08] [INFO ] Added : 0 causal constraints over 0 iterations in 671 ms. Result :sat
Minimization took 5233 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[182] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[182] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 75 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 69 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2025-06-05 08:19:14] [INFO ] Invariant cache hit.
[2025-06-05 08:19:17] [INFO ] Implicit Places using invariants in 3148 ms returned []
[2025-06-05 08:19:17] [INFO ] Invariant cache hit.
[2025-06-05 08:19:26] [INFO ] Implicit Places using invariants and state equation in 9261 ms returned []
Implicit Place search using SMT with State Equation took 12413 ms to find 0 implicit places.
[2025-06-05 08:19:26] [INFO ] Redundant transitions in 325 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 12817 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2025-06-05 08:19:28] [INFO ] Flatten gal took : 904 ms
[2025-06-05 08:19:28] [INFO ] Flatten gal took : 468 ms
[2025-06-05 08:19:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3986399731051797002.gal : 160 ms
[2025-06-05 08:19:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12111180240657888826.prop : 20 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/ReachabilityCardinality3986399731051797002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12111180240657888826.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/ReachabilityCardinality12111180240657888826.prop.
RANDOM walk for 40000 steps (230 resets) in 20730 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5579 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4240 ms. (9 steps per ms) remains 2/2 properties
Probabilistic random walk after 178880 steps, saw 178797 distinct states, run finished after 24062 ms. (steps per millisecond=7 ) properties seen :0
[2025-06-05 08:19:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3435 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 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/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9722ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 83 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 3332/3332 places, 2744/2744 transitions.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 501
RANDOM walk for 40000 steps (231 resets) in 17990 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4540 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4190 ms. (9 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-05 08:20:19] [INFO ] Flatten gal took : 181 ms
[2025-06-05 08:20:19] [INFO ] Applying decomposition
[2025-06-05 08:20:19] [INFO ] Flatten gal took : 180 ms
Probabilistic random walk after 127225 steps, saw 127166 distinct states, run finished after 18078 ms. (steps per millisecond=7 ) properties seen :0
[2025-06-05 08:20:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-05 08:20: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/graph3366935562451591715.txt' '-o' '/tmp/graph3366935562451591715.bin' '-w' '/tmp/graph3366935562451591715.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)
[2025-06-05 08:20:38] [INFO ] Flatten gal took : 163 ms
[2025-06-05 08:20:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5786241073549136414.gal : 28 ms
[2025-06-05 08:20:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13074544216693122376.prop : 6 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/ReachabilityCardinality5786241073549136414.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13074544216693122376.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/ReachabilityCardinality13074544216693122376.prop.
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2744/6076 variables, 3332/3920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 501
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45053 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 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/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28070 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 73788ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 2129 ms.
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 72 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[182] Max Struct:[196]
Starting property specific reduction for Sudoku-COL-AN14-UpperBounds-04
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:[196]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[196]
[2025-06-05 08:21:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[196]
RANDOM walk for 10000 steps (57 resets) in 2656 ms. (3 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 813 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[177] Max Struct:[196]
[2025-06-05 08:21:53] [INFO ] Invariant cache hit.
[2025-06-05 08:21:55] [INFO ] [Real]Absence check using 588 positive place invariants in 1611 ms returned sat
[2025-06-05 08:21:57] [INFO ] [Real]Absence check using state equation in 2016 ms returned sat
[2025-06-05 08:21:59] [INFO ] Deduced a trap composed of 15 places in 1254 ms of which 210 ms to minimize.
[2025-06-05 08:21:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[177] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[177] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 65 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2025-06-05 08:21:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[177] Max Struct:[196]
RANDOM walk for 118213 steps (686 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 62452 steps (0 resets) in 5005 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[179] Max Struct:[196]
[2025-06-05 08:22:34] [INFO ] Invariant cache hit.
[2025-06-05 08:22:36] [INFO ] [Real]Absence check using 588 positive place invariants in 1233 ms returned sat
[2025-06-05 08:23:01] [INFO ] [Real]Absence check using state equation in 25158 ms returned sat
[2025-06-05 08:23:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 179 ms.
[2025-06-05 08:23:01] [INFO ] Added : 0 causal constraints over 0 iterations in 478 ms. Result :sat
Minimization took 5229 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[179] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[179] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 68 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 89 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2025-06-05 08:23:07] [INFO ] Invariant cache hit.
[2025-06-05 08:23:10] [INFO ] Implicit Places using invariants in 2954 ms returned []
[2025-06-05 08:23:10] [INFO ] Invariant cache hit.
[2025-06-05 08:23:19] [INFO ] Implicit Places using invariants and state equation in 8738 ms returned []
Implicit Place search using SMT with State Equation took 11696 ms to find 0 implicit places.
[2025-06-05 08:23:19] [INFO ] Redundant transitions in 88 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 11886 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2025-06-05 08:23:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[179] Max Struct:[196]
RANDOM walk for 118180 steps (685 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 58429 steps (0 resets) in 5014 ms. (11 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[181] Max Struct:[196]
[2025-06-05 08:23:54] [INFO ] Invariant cache hit.
[2025-06-05 08:23:57] [INFO ] [Real]Absence check using 588 positive place invariants in 2507 ms returned sat
[2025-06-05 08:24:16] [INFO ] [Real]Absence check using state equation in 19107 ms returned sat
[2025-06-05 08:24:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 174 ms.
[2025-06-05 08:24:17] [INFO ] Added : 0 causal constraints over 0 iterations in 638 ms. Result :sat
Minimization took 5120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[181] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[181] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 58 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 58 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2025-06-05 08:24:22] [INFO ] Invariant cache hit.
[2025-06-05 08:24:26] [INFO ] Implicit Places using invariants in 3766 ms returned []
[2025-06-05 08:24:26] [INFO ] Invariant cache hit.
[2025-06-05 08:24:35] [INFO ] Implicit Places using invariants and state equation in 9191 ms returned []
Implicit Place search using SMT with State Equation took 12963 ms to find 0 implicit places.
[2025-06-05 08:24:35] [INFO ] Redundant transitions in 88 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 13118 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2025-06-05 08:24:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[181] Max Struct:[196]
RANDOM walk for 118534 steps (687 resets) in 30001 ms. (3 steps per ms)
BEST_FIRST walk for 64465 steps (0 resets) in 5055 ms. (12 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[181] Max Struct:[196]
[2025-06-05 08:25:10] [INFO ] Invariant cache hit.
[2025-06-05 08:25:14] [INFO ] [Real]Absence check using 588 positive place invariants in 2532 ms returned sat
[2025-06-05 08:25:33] [INFO ] [Real]Absence check using state equation in 19683 ms returned sat
[2025-06-05 08:25:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 236 ms.
[2025-06-05 08:25:34] [INFO ] Added : 0 causal constraints over 0 iterations in 646 ms. Result :sat
Minimization took 5492 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[181] Max Struct:[196]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[181] Max Struct:[196]
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 65 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 62 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2025-06-05 08:25:40] [INFO ] Invariant cache hit.
[2025-06-05 08:25:44] [INFO ] Implicit Places using invariants in 3823 ms returned []
[2025-06-05 08:25:44] [INFO ] Invariant cache hit.
[2025-06-05 08:25:55] [INFO ] Implicit Places using invariants and state equation in 11291 ms returned []
Implicit Place search using SMT with State Equation took 15118 ms to find 0 implicit places.
[2025-06-05 08:25:55] [INFO ] Redundant transitions in 148 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 15340 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2025-06-05 08:25:56] [INFO ] Flatten gal took : 241 ms
[2025-06-05 08:25:56] [INFO ] Flatten gal took : 351 ms
[2025-06-05 08:25:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7426246905967098596.gal : 58 ms
[2025-06-05 08:25:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5789790620438247249.prop : 6 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/ReachabilityCardinality7426246905967098596.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5789790620438247249.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 ...328
Loading property file /tmp/ReachabilityCardinality5789790620438247249.prop.
RANDOM walk for 40000 steps (229 resets) in 18425 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4106 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4053 ms. (9 steps per ms) remains 2/2 properties
Probabilistic random walk after 173219 steps, saw 173139 distinct states, run finished after 21125 ms. (steps per millisecond=8 ) properties seen :0
[2025-06-05 08:26:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 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/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2535 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8161ms 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 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 68 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 3332/3332 places, 2744/2744 transitions.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 501
RANDOM walk for 40000 steps (231 resets) in 17814 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4331 ms. (9 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4369 ms. (9 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2025-06-05 08:26:46] [INFO ] Flatten gal took : 135 ms
[2025-06-05 08:26:46] [INFO ] Applying decomposition
[2025-06-05 08:26:46] [INFO ] Flatten gal took : 126 ms
Probabilistic random walk after 132075 steps, saw 132014 distinct states, run finished after 18093 ms. (steps per millisecond=7 ) properties seen :0
[2025-06-05 08:26:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-05 08:27:03] [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/graph8154674437819041007.txt' '-o' '/tmp/graph8154674437819041007.bin' '-w' '/tmp/graph8154674437819041007.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)
[2025-06-05 08:27:04] [INFO ] Flatten gal took : 165 ms
[2025-06-05 08:27:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13115392976463983538.gal : 27 ms
[2025-06-05 08:27:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3372564479558061989.prop : 3 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/ReachabilityCardinality13115392976463983538.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3372564479558061989.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
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality3372564479558061989.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2744/6076 variables, 3332/3920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 501
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45032 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 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/2744 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 588/3332 variables, 588/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45006 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 90749ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 58 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 55 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2025-06-05 08:28:28] [INFO ] Invariant cache hit.
[2025-06-05 08:28:32] [INFO ] Implicit Places using invariants in 3975 ms returned []
[2025-06-05 08:28:32] [INFO ] Invariant cache hit.
[2025-06-05 08:28:40] [INFO ] Implicit Places using invariants and state equation in 8386 ms returned []
Implicit Place search using SMT with State Equation took 12367 ms to find 0 implicit places.
[2025-06-05 08:28:40] [INFO ] Redundant transitions in 97 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 12525 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[181] Max Struct:[196]
Ending property specific reduction for Sudoku-COL-AN14-UpperBounds-04 in 410768 ms.
[2025-06-05 08:28:41] [INFO ] Flatten gal took : 139 ms
[2025-06-05 08:28:41] [INFO ] Applying decomposition
[2025-06-05 08:28:41] [INFO ] Flatten gal took : 150 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/graph15045546044176246975.txt' '-o' '/tmp/graph15045546044176246975.bin' '-w' '/tmp/graph15045546044176246975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15045546044176246975.bin' '-l' '-1' '-v' '-w' '/tmp/graph15045546044176246975.weights' '-q' '0' '-e' '0.001'
[2025-06-05 08:28:41] [INFO ] Decomposing Gal with order
[2025-06-05 08:28:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 08:28:42] [INFO ] Removed a total of 4900 redundant transitions.
[2025-06-05 08:28:42] [INFO ] Flatten gal took : 441 ms
[2025-06-05 08:28:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 52 ms.
[2025-06-05 08:28:43] [INFO ] Time to serialize gal into /tmp/UpperBounds696034425051961131.gal : 57 ms
[2025-06-05 08:28:43] [INFO ] Time to serialize properties into /tmp/UpperBounds16013613355712819254.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/UpperBounds696034425051961131.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16013613355712819254.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/UpperBounds16013613355712819254.prop.
BK_STOP 1749112442516
--------------------
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-AN14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Sudoku-COL-AN14, 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 r237-smll-174903502700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN14.tgz
mv Sudoku-COL-AN14 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.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 ;