./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-20 04:27:34,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-20 04:27:34,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-20 04:27:34,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-20 04:27:34,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-20 04:27:34,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-20 04:27:34,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-20 04:27:34,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-20 04:27:34,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-20 04:27:34,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-20 04:27:34,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-20 04:27:34,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-20 04:27:34,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-20 04:27:34,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-20 04:27:34,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-20 04:27:34,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-20 04:27:34,770 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 04:27:34,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-20 04:27:34,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-20 04:27:34,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-20 04:27:34,771 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-20 04:27:34,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-20 04:27:34,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-20 04:27:34,771 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-20 04:27:34,771 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-20 04:27:34,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-03-20 04:27:34,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-20 04:27:35,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-20 04:27:35,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-20 04:27:35,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-20 04:27:35,010 INFO L274 PluginConnector]: CDTParser initialized [2025-03-20 04:27:35,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-20 04:27:36,239 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/79afe41d4/60f37eda79864b77a841edbfe582045b/FLAG06cfa9ff2 [2025-03-20 04:27:36,404 INFO L389 CDTParser]: Found 1 translation units. [2025-03-20 04:27:36,405 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-20 04:27:36,412 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/79afe41d4/60f37eda79864b77a841edbfe582045b/FLAG06cfa9ff2 [2025-03-20 04:27:37,288 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/79afe41d4/60f37eda79864b77a841edbfe582045b [2025-03-20 04:27:37,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-20 04:27:37,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-20 04:27:37,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-20 04:27:37,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-20 04:27:37,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-20 04:27:37,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1307753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37, skipping insertion in model container [2025-03-20 04:27:37,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-20 04:27:37,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-03-20 04:27:37,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 04:27:37,453 INFO L200 MainTranslator]: Completed pre-run [2025-03-20 04:27:37,481 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-03-20 04:27:37,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 04:27:37,503 INFO L204 MainTranslator]: Completed translation [2025-03-20 04:27:37,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37 WrapperNode [2025-03-20 04:27:37,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-20 04:27:37,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-20 04:27:37,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-20 04:27:37,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-20 04:27:37,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,544 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-03-20 04:27:37,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-20 04:27:37,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-20 04:27:37,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-20 04:27:37,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-20 04:27:37,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-20 04:27:37,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-20 04:27:37,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-20 04:27:37,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-20 04:27:37,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (1/1) ... [2025-03-20 04:27:37,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 04:27:37,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:27:37,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-20 04:27:37,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-20 04:27:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-20 04:27:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-20 04:27:37,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-20 04:27:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-20 04:27:37,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-20 04:27:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-20 04:27:37,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-20 04:27:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-20 04:27:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-20 04:27:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-20 04:27:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-20 04:27:37,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-20 04:27:37,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-20 04:27:37,618 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-20 04:27:37,699 INFO L234 CfgBuilder]: Building ICFG [2025-03-20 04:27:37,700 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-20 04:27:38,001 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-20 04:27:38,001 INFO L283 CfgBuilder]: Performing block encoding [2025-03-20 04:27:38,241 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-20 04:27:38,242 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-20 04:27:38,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:27:38 BoogieIcfgContainer [2025-03-20 04:27:38,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-20 04:27:38,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-20 04:27:38,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-20 04:27:38,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-20 04:27:38,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 04:27:37" (1/3) ... [2025-03-20 04:27:38,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adbe933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:27:38, skipping insertion in model container [2025-03-20 04:27:38,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:27:37" (2/3) ... [2025-03-20 04:27:38,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adbe933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:27:38, skipping insertion in model container [2025-03-20 04:27:38,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:27:38" (3/3) ... [2025-03-20 04:27:38,248 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-03-20 04:27:38,260 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-20 04:27:38,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 29 locations, 30 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-20 04:27:38,262 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-20 04:27:38,301 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-20 04:27:38,330 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 04:27:38,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-20 04:27:38,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:27:38,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-03-20 04:27:38,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-03-20 04:27:38,396 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 04:27:38,402 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 04:27:38,410 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@260ea70f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 04:27:38,410 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-20 04:27:38,658 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:38,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1978746636, now seen corresponding path program 1 times [2025-03-20 04:27:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:38,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544119450] [2025-03-20 04:27:38,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 04:27:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:38,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-20 04:27:38,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-20 04:27:38,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:27:38,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 04:27:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544119450] [2025-03-20 04:27:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544119450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 04:27:38,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 04:27:38,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 04:27:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486448874] [2025-03-20 04:27:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 04:27:38,893 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 04:27:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:27:38,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 04:27:38,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 04:27:38,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:38,916 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:27:38,917 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 04:27:38,917 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:38,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:38,962 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-20 04:27:38,962 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:38,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1659369491, now seen corresponding path program 1 times [2025-03-20 04:27:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993411150] [2025-03-20 04:27:38,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 04:27:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:38,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-20 04:27:38,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-20 04:27:38,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:27:38,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-20 04:27:39,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:39,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993411150] [2025-03-20 04:27:39,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993411150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 04:27:39,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 04:27:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 04:27:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270046291] [2025-03-20 04:27:39,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 04:27:39,145 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 04:27:39,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:27:39,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 04:27:39,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 04:27:39,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:39,146 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:27:39,146 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 04:27:39,146 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:39,146 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:39,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:39,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:39,230 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-20 04:27:39,230 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:39,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:39,230 INFO L85 PathProgramCache]: Analyzing trace with hash 422313311, now seen corresponding path program 1 times [2025-03-20 04:27:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:39,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922909781] [2025-03-20 04:27:39,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 04:27:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:39,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-20 04:27:39,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-20 04:27:39,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:27:39,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-20 04:27:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:39,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922909781] [2025-03-20 04:27:39,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922909781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 04:27:39,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478735581] [2025-03-20 04:27:39,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 04:27:39,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:27:39,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:27:39,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 04:27:39,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-20 04:27:39,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-20 04:27:39,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-20 04:27:39,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:27:39,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:39,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-20 04:27:39,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 04:27:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-20 04:27:39,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 04:27:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-20 04:27:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478735581] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-20 04:27:39,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-20 04:27:39,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-20 04:27:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820585147] [2025-03-20 04:27:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 04:27:39,613 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 04:27:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:27:39,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 04:27:39,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-20 04:27:39,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:39,614 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:27:39,614 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 04:27:39,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:39,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:39,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:39,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:39,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:39,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:39,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-20 04:27:39,867 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-20 04:27:39,868 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:39,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1311441986, now seen corresponding path program 1 times [2025-03-20 04:27:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:39,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557103000] [2025-03-20 04:27:39,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 04:27:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-20 04:27:39,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-20 04:27:39,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:27:39,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-20 04:27:39,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:39,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557103000] [2025-03-20 04:27:39,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557103000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 04:27:39,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 04:27:39,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 04:27:39,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992808279] [2025-03-20 04:27:39,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 04:27:39,954 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 04:27:39,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:27:39,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 04:27:39,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 04:27:39,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:39,954 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:27:39,954 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 04:27:39,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:39,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:39,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:39,955 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:40,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:40,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:40,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:40,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:40,016 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-20 04:27:40,016 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:40,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:40,017 INFO L85 PathProgramCache]: Analyzing trace with hash 71415543, now seen corresponding path program 1 times [2025-03-20 04:27:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:40,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825863398] [2025-03-20 04:27:40,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 04:27:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:40,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-20 04:27:40,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-20 04:27:40,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:27:40,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 04:27:40,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:40,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825863398] [2025-03-20 04:27:40,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825863398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 04:27:40,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121054942] [2025-03-20 04:27:40,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 04:27:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:27:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:27:40,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 04:27:40,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-20 04:27:40,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-20 04:27:40,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-20 04:27:40,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:27:40,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:40,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-20 04:27:41,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 04:27:41,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-20 04:27:41,296 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 04:27:41,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-03-20 04:27:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 04:27:41,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 04:27:41,563 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 04:27:41,563 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2025-03-20 04:27:41,860 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 04:27:41,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 227 [2025-03-20 04:27:41,871 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 04:27:41,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 134 [2025-03-20 04:27:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 04:27:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121054942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 04:27:42,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 04:27:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-20 04:27:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791313988] [2025-03-20 04:27:42,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 04:27:42,053 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-20 04:27:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:27:42,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-20 04:27:42,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-03-20 04:27:42,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:42,055 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:27:42,055 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 04:27:42,055 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:42,055 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:42,055 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:42,055 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:42,055 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:42,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:42,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:42,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:42,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:42,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:27:42,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-20 04:27:42,558 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:27:42,558 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:42,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:42,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1470951831, now seen corresponding path program 2 times [2025-03-20 04:27:42,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:42,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696144638] [2025-03-20 04:27:42,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 04:27:42,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:42,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-20 04:27:42,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-20 04:27:42,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 04:27:42,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-20 04:27:43,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:43,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696144638] [2025-03-20 04:27:43,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696144638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 04:27:43,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 04:27:43,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-20 04:27:43,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721381380] [2025-03-20 04:27:43,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 04:27:43,026 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-20 04:27:43,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:27:43,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-20 04:27:43,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-20 04:27:43,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:43,028 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:27:43,028 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 04:27:43,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:43,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:43,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:27:43,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:43,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:43,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:43,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:27:43,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:27:43,248 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-20 04:27:43,248 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:43,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1648941200, now seen corresponding path program 3 times [2025-03-20 04:27:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:43,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311184238] [2025-03-20 04:27:43,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 04:27:43,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:43,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-20 04:27:43,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-20 04:27:43,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-20 04:27:43,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-20 04:27:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:43,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311184238] [2025-03-20 04:27:43,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311184238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 04:27:43,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 04:27:43,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-20 04:27:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168807939] [2025-03-20 04:27:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 04:27:43,386 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 04:27:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:27:43,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 04:27:43,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-20 04:27:43,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:43,386 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:27:43,386 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 04:27:43,386 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:43,386 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,387 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:43,387 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,387 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:27:43,387 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:27:43,387 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:43,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:43,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:43,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:27:43,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:27:43,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 04:27:43,594 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-20 04:27:43,594 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:43,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash -964864715, now seen corresponding path program 1 times [2025-03-20 04:27:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785334861] [2025-03-20 04:27:43,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 04:27:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:43,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-20 04:27:43,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-20 04:27:43,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:27:43,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-20 04:27:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785334861] [2025-03-20 04:27:43,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785334861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 04:27:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593388393] [2025-03-20 04:27:43,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 04:27:43,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:27:43,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:27:43,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 04:27:43,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-20 04:27:43,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-20 04:27:43,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-20 04:27:43,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 04:27:43,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:43,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-20 04:27:43,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 04:27:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-20 04:27:43,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 04:27:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-20 04:27:43,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593388393] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-20 04:27:43,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-20 04:27:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-20 04:27:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983298546] [2025-03-20 04:27:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 04:27:43,894 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-20 04:27:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:27:43,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-20 04:27:43,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-20 04:27:43,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:43,895 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:27:43,895 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 04:27:43,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:43,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:43,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:27:43,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:27:43,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 04:27:43,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:43,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:43,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:43,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:43,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:27:43,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:27:43,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 04:27:43,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:27:43,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-20 04:27:44,172 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:27:44,172 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:44,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1509738285, now seen corresponding path program 4 times [2025-03-20 04:27:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:44,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205393799] [2025-03-20 04:27:44,173 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 04:27:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:44,182 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-20 04:27:44,187 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-20 04:27:44,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 04:27:44,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-20 04:27:44,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:44,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205393799] [2025-03-20 04:27:44,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205393799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 04:27:44,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293974172] [2025-03-20 04:27:44,282 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 04:27:44,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:27:44,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:27:44,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 04:27:44,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-20 04:27:44,337 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-20 04:27:44,364 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-20 04:27:44,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 04:27:44,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:44,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-20 04:27:44,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 04:27:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-20 04:27:44,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 04:27:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-20 04:27:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293974172] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-20 04:27:44,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-20 04:27:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 17 [2025-03-20 04:27:44,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392655940] [2025-03-20 04:27:44,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 04:27:44,585 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-20 04:27:44,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 04:27:44,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-20 04:27:44,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-20 04:27:44,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:44,586 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 04:27:44,586 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 04:27:44,587 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:44,587 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:44,587 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:44,587 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:44,587 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:27:44,587 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:27:44,587 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 04:27:44,587 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:27:44,587 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 04:27:44,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 04:27:44,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:44,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 04:27:44,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 04:27:44,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-20 04:27:44,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-20 04:27:44,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 04:27:44,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-20 04:27:44,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-20 04:27:44,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-20 04:27:44,918 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-20 04:27:44,918 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-20 04:27:44,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 04:27:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1936427052, now seen corresponding path program 5 times [2025-03-20 04:27:44,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 04:27:44,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134129319] [2025-03-20 04:27:44,918 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 04:27:44,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 04:27:44,925 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-20 04:27:44,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-20 04:27:44,953 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 04:27:44,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 04:27:46,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 04:27:46,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134129319] [2025-03-20 04:27:46,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134129319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 04:27:46,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23424686] [2025-03-20 04:27:46,294 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 04:27:46,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 04:27:46,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 04:27:46,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 04:27:46,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-20 04:27:46,344 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-20 04:27:46,371 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-20 04:27:46,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-20 04:27:46,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 04:27:46,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-20 04:27:46,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 04:27:46,541 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-20 04:27:47,070 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 04:27:47,070 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-03-20 04:27:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 04:27:47,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 04:27:47,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 04:27:47,683 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1784 treesize of output 1600 [2025-03-20 04:27:52,698 INFO L172 IndexEqualityManager]: detected equality via solver [2025-03-20 04:27:52,699 INFO L172 IndexEqualityManager]: detected equality via solver [2025-03-20 04:27:52,710 INFO L172 IndexEqualityManager]: detected equality via solver [2025-03-20 04:27:52,717 INFO L172 IndexEqualityManager]: detected equality via solver [2025-03-20 04:27:52,918 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 04:27:52,919 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 3971 treesize of output 2161 [2025-03-20 04:27:55,376 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 04:27:55,409 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 04:27:55,538 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:27:55,945 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:27:56,836 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:27:56,932 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:27:57,019 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 04:27:57,127 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 04:27:57,350 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 04:27:57,473 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-20 04:27:57,666 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 04:27:57,746 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-20 04:27:57,911 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:27:57,988 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:27:58,043 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:27:58,095 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:27:58,145 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 04:27:58,469 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 04:27:58,494 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:27:58,608 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 04:27:58,637 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:27:58,799 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:27:58,930 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:27:59,026 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:27:59,090 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:27:59,539 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:27:59,687 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:27:59,793 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:27:59,893 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:28:00,720 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:28:00,852 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:28:00,897 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:28:00,971 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:28:01,172 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:28:01,245 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:28:01,602 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:28:01,719 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 04:28:01,747 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:28:01,881 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 04:28:01,909 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:28:02,051 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:28:02,482 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:28:02,549 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:28:02,659 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:28:02,714 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:02,788 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:28:03,571 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:28:03,649 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:28:04,028 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:28:04,095 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:28:04,214 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:28:04,275 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:28:04,364 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:28:04,503 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:09,008 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:28:10,913 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:11,031 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:28:11,107 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:11,202 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:11,257 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:28:11,358 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:28:11,438 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:28:13,429 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:28:13,541 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:28:13,702 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:28:13,776 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:28:14,181 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:28:14,270 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:28:14,388 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 04:28:14,528 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:28:14,923 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:28:15,002 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:28:15,985 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:16,116 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:28:16,279 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:21,098 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:28:21,197 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:21,293 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:28:23,224 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:23,288 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:28:23,360 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:28:23,454 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:28:23,594 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:28:28,087 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:28:28,181 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:28:28,415 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:28:28,483 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:28:28,658 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:28:52,324 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:28:52,433 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:28:52,576 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:29:16,484 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:29:16,949 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:29:27,325 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:29:27,448 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:29:37,803 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:29:38,067 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:29:42,490 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:29:42,577 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:29:43,378 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:29:43,605 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:29:45,571 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:29:47,418 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:29:51,621 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:29:51,687 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:30:01,697 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:30:01,934 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:30:02,049 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:30:02,210 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:30:02,268 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:30:02,416 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:30:02,500 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:02,609 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:02,684 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:03,510 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:03,589 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:03,642 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:03,695 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:30:03,772 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:05,651 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:05,807 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:05,894 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:30:06,222 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:06,323 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:08,258 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:08,355 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:08,434 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:09,256 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:09,315 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:30:09,703 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:30:09,848 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:30:10,655 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:30:21,061 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:30:21,235 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:25,750 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:30,241 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:30:30,357 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:32,306 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:33,142 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:35,083 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:35,194 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:35,279 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:37,276 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:38,122 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:38,203 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:40,149 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:44,663 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:30:44,787 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:30:45,160 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:45,991 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:46,100 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:30:46,450 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:46,510 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:30:46,669 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:30:47,029 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:47,097 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:47,951 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:49,909 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:30:49,990 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:50,832 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:30:51,180 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:52,005 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:52,353 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:30:52,499 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:30:52,579 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:52,651 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:52,744 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-20 04:30:52,852 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:30:53,714 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:30:55,667 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:31:00,112 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:31:00,255 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:31:00,360 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:31:01,195 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:31:01,351 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:31:01,432 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:31:01,525 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:31:03,486 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:31:03,837 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:31:03,965 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:31:04,336 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-20 04:31:04,584 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-03-20 04:31:04,727 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:31:05,092 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:31:05,244 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:31:05,752 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:31:07,737 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:31:12,257 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:31:12,333 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:31:12,434 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:31:12,502 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:31:12,604 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:31:12,875 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:31:14,794 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:31:19,204 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:31:19,306 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:31:19,465 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:31:19,712 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:31:19,840 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:31:43,590 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:31:43,885 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:31:44,372 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:32:37,904 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-03-20 04:32:38,019 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:32:38,107 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:33:31,591 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:33:54,941 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:33:55,044 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:33:55,124 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:33:55,205 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:33:55,294 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:33:55,362 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:05,884 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:34:06,034 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:06,093 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:06,195 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:10,857 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:10,931 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:11,750 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:13,654 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:13,752 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:14,660 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:34:14,821 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:14,931 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:15,014 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:17,073 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:17,151 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:19,118 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:23,604 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:23,711 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:34:23,793 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:23,858 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:23,932 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:24,749 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:24,811 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:24,891 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:34:25,041 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:34:25,136 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:25,276 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:35,335 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:34:35,426 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:34:35,713 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:34:35,850 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:34:36,063 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:36,134 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:34:36,521 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:37,372 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:37,488 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:37,604 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:37,752 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:34:38,096 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:38,904 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:39,014 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:34:39,389 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:34:39,734 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:39,806 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:39,895 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:39,987 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:41,955 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:34:42,047 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:42,148 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:44,040 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:44,116 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:44,171 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:44,987 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:34:45,066 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:45,185 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:45,266 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:34:45,500 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:34:45,630 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:45,768 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:50,180 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:34:50,261 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:50,400 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:50,694 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-03-20 04:34:50,965 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:34:51,799 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:51,979 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:34:52,168 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:34:52,263 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:34:52,458 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:35:02,947 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:35:03,047 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:35:03,126 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:35:03,379 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:35:28,336 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:35:28,447 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:35:28,576 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:35:29,065 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-03-20 04:35:29,175 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:35:29,254 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:35:29,654 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:36:25,657 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-03-20 04:36:25,776 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-03-20 04:36:26,874 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:38:30,969 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-03-20 04:38:31,070 WARN L656 sPolynomialRelations]: Constructing 1048576(two to the power of 20 dual juncts. [2025-03-20 04:38:31,224 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:39:26,972 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:39:27,522 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:39:32,066 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:39:42,833 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:39:43,013 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:39:47,699 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:39:47,847 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:39:48,109 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:40:12,512 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:40:12,744 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:40:12,866 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:40:13,129 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:40:13,236 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:40:13,457 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:40:13,764 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:41:08,480 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:41:09,008 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-03-20 04:41:09,129 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-03-20 04:41:09,239 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:41:09,330 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:41:33,534 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:41:35,473 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:41:35,570 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:41:46,110 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:41:46,265 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-03-20 04:41:46,356 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:41:46,430 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:41:51,588 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:41:51,703 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:41:51,856 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:41:51,993 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-03-20 04:41:52,165 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-03-20 04:42:02,851 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:42:02,934 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:42:04,991 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:42:05,987 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-03-20 04:42:06,060 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-03-20 04:42:06,904 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-03-20 04:42:07,018 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. Killed by 15