./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.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 42d87675 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-bad-three-array-sum-alt.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --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-42d8767-m [2025-04-25 03:25:20,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 03:25:20,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 03:25:20,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 03:25:20,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 03:25:20,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 03:25:20,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 03:25:20,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 03:25:20,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 03:25:20,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 03:25:20,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 03:25:20,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 03:25:20,590 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 03:25:20,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 03:25:20,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 03:25:20,592 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 03:25:20,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 03:25:20,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 03:25:20,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 03:25:20,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 03:25:20,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:25:20,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:25:20,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 03:25:20,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 03:25:20,594 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 03:25:20,594 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 03:25:20,594 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 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-04-25 03:25:20,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 03:25:20,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 03:25:20,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 03:25:20,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 03:25:20,812 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 03:25:20,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-25 03:25:22,102 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/431099ae0/c91cf334b792456597cfe0dd38ff212a/FLAGfb3d9d7d9 [2025-04-25 03:25:22,357 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 03:25:22,358 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-25 03:25:22,366 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/431099ae0/c91cf334b792456597cfe0dd38ff212a/FLAGfb3d9d7d9 [2025-04-25 03:25:23,103 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/431099ae0/c91cf334b792456597cfe0dd38ff212a [2025-04-25 03:25:23,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 03:25:23,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 03:25:23,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 03:25:23,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 03:25:23,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 03:25:23,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c946868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23, skipping insertion in model container [2025-04-25 03:25:23,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 03:25:23,296 WARN L116 LibraryModelHandler]: 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-25 03:25:23,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 03:25:23,324 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 03:25:23,348 WARN L116 LibraryModelHandler]: 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-25 03:25:23,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 03:25:23,362 INFO L204 MainTranslator]: Completed translation [2025-04-25 03:25:23,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23 WrapperNode [2025-04-25 03:25:23,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 03:25:23,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 03:25:23,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 03:25:23,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 03:25:23,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,398 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2025-04-25 03:25:23,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 03:25:23,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 03:25:23,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 03:25:23,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 03:25:23,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 03:25:23,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 03:25:23,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 03:25:23,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 03:25:23,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (1/1) ... [2025-04-25 03:25:23,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:25:23,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:25:23,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 03:25:23,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 03:25:23,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 03:25:23,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 03:25:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 03:25:23,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 03:25:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 03:25:23,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 03:25:23,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 03:25:23,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 03:25:23,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-25 03:25:23,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-25 03:25:23,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 03:25:23,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 03:25:23,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-25 03:25:23,469 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 03:25:23,543 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 03:25:23,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 03:25:23,841 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 03:25:23,841 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 03:25:24,118 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 03:25:24,118 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 03:25:24,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 03:25:24 BoogieIcfgContainer [2025-04-25 03:25:24,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 03:25:24,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 03:25:24,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 03:25:24,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 03:25:24,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 03:25:23" (1/3) ... [2025-04-25 03:25:24,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fed81b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 03:25:24, skipping insertion in model container [2025-04-25 03:25:24,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:25:23" (2/3) ... [2025-04-25 03:25:24,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fed81b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 03:25:24, skipping insertion in model container [2025-04-25 03:25:24,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 03:25:24" (3/3) ... [2025-04-25 03:25:24,126 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-04-25 03:25:24,136 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 03:25:24,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 28 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-25 03:25:24,140 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 03:25:24,187 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-25 03:25:24,222 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 03:25:24,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 03:25:24,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:25:24,228 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-04-25 03:25:24,228 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-04-25 03:25:24,283 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 03:25:24,291 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 03:25:24,297 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;@61a6e027, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 03:25:24,297 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-25 03:25:24,393 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-04-25 03:25:24,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:25:24,396 INFO L85 PathProgramCache]: Analyzing trace with hash 495884667, now seen corresponding path program 1 times [2025-04-25 03:25:24,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:25:24,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239228190] [2025-04-25 03:25:24,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:24,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:25:24,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-25 03:25:24,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-25 03:25:24,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:24,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:25:24,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:25:24,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239228190] [2025-04-25 03:25:24,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239228190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:25:24,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:25:24,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 03:25:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543964703] [2025-04-25 03:25:24,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:25:24,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 03:25:24,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:25:24,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 03:25:24,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 03:25:24,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:24,872 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:25:24,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-04-25 03:25:24,872 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:24,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:25:24,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 03:25:24,931 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-04-25 03:25:24,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:25:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2015914507, now seen corresponding path program 1 times [2025-04-25 03:25:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:25:24,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48524948] [2025-04-25 03:25:24,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:25:24,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-25 03:25:24,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-25 03:25:24,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:24,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:25:25,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:25:25,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48524948] [2025-04-25 03:25:25,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48524948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:25:25,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:25:25,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 03:25:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877526185] [2025-04-25 03:25:25,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:25:25,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 03:25:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:25:25,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 03:25:25,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-25 03:25:25,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:25,137 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:25:25,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-04-25 03:25:25,138 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:25:25,138 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:25,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:25:25,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:25,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 03:25:25,217 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-04-25 03:25:25,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:25:25,218 INFO L85 PathProgramCache]: Analyzing trace with hash 719758239, now seen corresponding path program 1 times [2025-04-25 03:25:25,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:25:25,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523631686] [2025-04-25 03:25:25,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:25,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:25:25,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 03:25:25,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 03:25:25,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:25,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:25:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:25:25,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523631686] [2025-04-25 03:25:25,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523631686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:25:25,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291184147] [2025-04-25 03:25:25,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:25,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:25:25,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:25:25,402 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-04-25 03:25:25,404 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-04-25 03:25:25,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 03:25:25,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 03:25:25,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:25,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:25,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 03:25:25,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:25:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:25:25,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:25:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:25:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291184147] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-25 03:25:25,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:25:25,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-25 03:25:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002101819] [2025-04-25 03:25:25,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:25:25,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 03:25:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:25:25,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 03:25:25,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-25 03:25:25,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:25,660 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:25:25,660 INFO L486 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-04-25 03:25:25,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:25:25,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:25,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:25,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:25:25,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:25,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:25,738 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-04-25 03:25:25,931 WARN L466 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-04-25 03:25:25,931 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-04-25 03:25:25,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:25:25,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2045346905, now seen corresponding path program 1 times [2025-04-25 03:25:25,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:25:25,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896055946] [2025-04-25 03:25:25,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:25,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:25:25,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 03:25:25,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 03:25:25,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:25,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:25:26,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:25:26,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896055946] [2025-04-25 03:25:26,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896055946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:25:26,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101374170] [2025-04-25 03:25:26,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:26,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:25:26,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:25:26,059 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-04-25 03:25:26,061 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-04-25 03:25:26,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 03:25:26,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 03:25:26,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:26,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:26,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 03:25:26,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:25:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:25:26,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:25:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:25:26,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101374170] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-25 03:25:26,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:25:26,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-25 03:25:26,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311064474] [2025-04-25 03:25:26,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:25:26,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 03:25:26,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:25:26,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 03:25:26,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-25 03:25:26,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:26,247 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:25:26,247 INFO L486 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-04-25 03:25:26,247 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:25:26,247 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,247 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,247 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:26,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:25:26,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-25 03:25:26,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:25:26,516 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-04-25 03:25:26,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:25:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1534092972, now seen corresponding path program 1 times [2025-04-25 03:25:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:25:26,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214677160] [2025-04-25 03:25:26,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:25:26,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 03:25:26,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 03:25:26,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:26,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:25:26,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:25:26,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214677160] [2025-04-25 03:25:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214677160] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:25:26,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117618008] [2025-04-25 03:25:26,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:26,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:25:26,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:25:26,647 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-04-25 03:25:26,649 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-04-25 03:25:26,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 03:25:26,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 03:25:26,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:26,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:26,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 03:25:26,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:25:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:25:26,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:25:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:25:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117618008] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-25 03:25:26,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:25:26,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-25 03:25:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785088469] [2025-04-25 03:25:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:25:26,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 03:25:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:25:26,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 03:25:26,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-25 03:25:26,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:26,818 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:25:26,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-04-25 03:25:26,818 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:25:26,818 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,818 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,818 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,818 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:25:26,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:25:26,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:25:26,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-25 03:25:27,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:25:27,081 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-04-25 03:25:27,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:25:27,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1834931580, now seen corresponding path program 1 times [2025-04-25 03:25:27,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:25:27,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64795975] [2025-04-25 03:25:27,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:27,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:25:27,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-25 03:25:27,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 03:25:27,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:27,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:25:28,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:25:28,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64795975] [2025-04-25 03:25:28,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64795975] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:25:28,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2252605] [2025-04-25 03:25:28,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:25:28,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:25:28,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:25:28,307 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-04-25 03:25:28,309 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-04-25 03:25:28,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-25 03:25:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 03:25:28,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:25:28,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:25:28,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-25 03:25:28,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:25:28,617 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:25:28,618 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 28 treesize of output 24 [2025-04-25 03:25:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:25:28,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:08,810 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:26:08,811 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 95 [2025-04-25 03:26:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:09,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2252605] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:09,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 03:26:09,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 24 [2025-04-25 03:26:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48044907] [2025-04-25 03:26:09,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:09,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-25 03:26:09,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:26:09,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-25 03:26:09,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=477, Unknown=9, NotChecked=0, Total=600 [2025-04-25 03:26:09,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:09,149 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:09,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 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-04-25 03:26:09,149 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:09,149 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:09,149 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:09,149 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:09,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:09,150 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:09,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:09,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:09,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:09,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:09,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:09,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:09,689 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-04-25 03:26:09,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-25 03:26:09,883 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-04-25 03:26:09,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash 839834132, now seen corresponding path program 2 times [2025-04-25 03:26:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:26:09,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958642453] [2025-04-25 03:26:09,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 03:26:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:26:09,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-25 03:26:09,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 03:26:09,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 03:26:09,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:26:09,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958642453] [2025-04-25 03:26:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958642453] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:26:09,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475199700] [2025-04-25 03:26:09,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 03:26:09,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:09,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:09,997 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-04-25 03:26:09,998 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-04-25 03:26:10,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-25 03:26:10,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 03:26:10,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 03:26:10,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:10,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 03:26:10,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:10,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-25 03:26:10,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475199700] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-25 03:26:10,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:26:10,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 14 [2025-04-25 03:26:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231753722] [2025-04-25 03:26:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:26:10,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 03:26:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:26:10,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 03:26:10,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-25 03:26:10,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:10,183 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:10,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-04-25 03:26:10,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:10,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:10,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:10,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:10,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:10,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:10,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:10,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:10,500 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-04-25 03:26:10,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1077974413, now seen corresponding path program 3 times [2025-04-25 03:26:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:26:10,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071003924] [2025-04-25 03:26:10,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 03:26:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:26:10,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-25 03:26:10,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 03:26:10,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 03:26:10,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:26:10,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:26:10,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071003924] [2025-04-25 03:26:10,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071003924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:26:10,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134018793] [2025-04-25 03:26:10,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 03:26:10,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:10,616 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:10,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-25 03:26:10,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-25 03:26:10,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 03:26:10,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 03:26:10,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:10,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-25 03:26:10,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:26:10,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:26:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134018793] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:10,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 03:26:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-25 03:26:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634889164] [2025-04-25 03:26:10,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:10,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-25 03:26:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:26:10,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-25 03:26:10,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-25 03:26:10,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:10,837 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:10,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 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-04-25 03:26:10,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:10,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:10,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:10,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:10,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:10,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:10,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:10,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:10,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:10,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:11,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-25 03:26:11,139 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-04-25 03:26:11,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash -476849891, now seen corresponding path program 4 times [2025-04-25 03:26:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:26:11,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254452861] [2025-04-25 03:26:11,140 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 03:26:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:26:11,150 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-25 03:26:11,161 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 03:26:11,162 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 03:26:11,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:11,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:26:11,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254452861] [2025-04-25 03:26:11,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254452861] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:26:11,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007810085] [2025-04-25 03:26:11,278 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 03:26:11,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:11,280 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:11,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-25 03:26:11,343 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-25 03:26:11,373 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 03:26:11,373 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 03:26:11,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:11,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-25 03:26:11,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:11,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007810085] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:11,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 03:26:11,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-04-25 03:26:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519479298] [2025-04-25 03:26:11,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:11,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-25 03:26:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:26:11,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-25 03:26:11,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-04-25 03:26:11,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:11,513 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:11,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 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-04-25 03:26:11,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:11,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:11,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:11,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:11,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:11,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:11,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:11,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:11,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:11,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:11,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:11,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:11,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:11,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:11,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:11,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:11,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:11,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:11,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:11,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:11,836 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-04-25 03:26:11,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1528419976, now seen corresponding path program 5 times [2025-04-25 03:26:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:26:11,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129747505] [2025-04-25 03:26:11,836 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 03:26:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:26:11,847 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-25 03:26:11,857 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 03:26:11,857 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 03:26:11,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:11,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:26:11,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129747505] [2025-04-25 03:26:11,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129747505] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:26:11,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139824929] [2025-04-25 03:26:11,933 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 03:26:11,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:11,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:11,935 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:11,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-25 03:26:11,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-25 03:26:12,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 03:26:12,035 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 03:26:12,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:12,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-25 03:26:12,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:12,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139824929] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:12,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 03:26:12,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-25 03:26:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409189994] [2025-04-25 03:26:12,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:12,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 03:26:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:26:12,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 03:26:12,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-25 03:26:12,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:12,175 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:12,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:12,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:26:12,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-25 03:26:12,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-25 03:26:12,499 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:26:12,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash -651716587, now seen corresponding path program 6 times [2025-04-25 03:26:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:26:12,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974153539] [2025-04-25 03:26:12,500 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 03:26:12,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:26:12,508 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-25 03:26:12,522 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-25 03:26:12,522 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-25 03:26:12,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:12,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:26:12,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974153539] [2025-04-25 03:26:12,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974153539] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:26:12,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112813806] [2025-04-25 03:26:12,628 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 03:26:12,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:12,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:12,630 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:12,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-25 03:26:12,691 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 2 equivalence classes. [2025-04-25 03:26:12,724 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-25 03:26:12,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-25 03:26:12,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:12,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-25 03:26:12,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:12,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:12,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112813806] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:12,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 03:26:12,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-25 03:26:12,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695752706] [2025-04-25 03:26:12,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:12,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-25 03:26:12,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:26:12,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-25 03:26:12,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-04-25 03:26:12,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:12,862 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:12,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:26:12,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:26:13,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:13,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:13,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-25 03:26:13,247 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:26:13,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:13,247 INFO L85 PathProgramCache]: Analyzing trace with hash -876171557, now seen corresponding path program 7 times [2025-04-25 03:26:13,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:26:13,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682241891] [2025-04-25 03:26:13,248 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-25 03:26:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:26:13,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-25 03:26:13,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-25 03:26:13,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:13,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:26:14,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:26:14,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682241891] [2025-04-25 03:26:14,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682241891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:26:14,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358876539] [2025-04-25 03:26:14,403 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-25 03:26:14,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:14,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:14,405 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:14,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-25 03:26:14,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-25 03:26:14,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-25 03:26:14,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:14,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:14,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-25 03:26:14,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:14,757 INFO L325 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-04-25 03:26:14,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-04-25 03:26:15,076 INFO L325 Elim1Store]: treesize reduction 12, result has 88.6 percent of original size [2025-04-25 03:26:15,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 153 [2025-04-25 03:26:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-25 03:26:15,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:19,406 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~C~0.base Int)) (let ((.cse1 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse3 (select (select |c_#memory_int| c_~B~0.base) (+ .cse1 c_~B~0.offset))) (.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse1)))) (let ((.cse5 (store |c_#memory_int| ~C~0.base (store (select |c_#memory_int| ~C~0.base) (+ .cse1 ~C~0.offset) (+ .cse3 .cse4))))) (let ((.cse0 (select .cse5 c_~B~0.base)) (.cse2 (select .cse5 c_~A~0.base))) (= (+ (select .cse0 (+ .cse1 4 c_~B~0.offset)) (select .cse2 (+ c_~A~0.offset .cse1 4)) c_~csum~0 .cse3 .cse4) (+ (select .cse0 (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) (select .cse2 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~asum~0 c_~bsum~0))))))) is different from false [2025-04-25 03:26:23,204 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-25 03:26:23,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-25 03:26:23,205 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-25 03:26:23,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:23,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:23,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-25 03:26:23,413 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:840) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:784) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:372) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:321) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:551) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2025-04-25 03:26:23,419 INFO L158 Benchmark]: Toolchain (without parser) took 60311.19ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 109.7MB in the beginning and 225.7MB in the end (delta: -116.0MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2025-04-25 03:26:23,419 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 03:26:23,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.07ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 95.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-25 03:26:23,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.42ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 03:26:23,420 INFO L158 Benchmark]: Boogie Preprocessor took 23.41ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 03:26:23,421 INFO L158 Benchmark]: RCFGBuilder took 695.78ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 77.2MB in the end (delta: 14.1MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2025-04-25 03:26:23,421 INFO L158 Benchmark]: TraceAbstraction took 59297.80ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 76.4MB in the beginning and 225.7MB in the end (delta: -149.3MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2025-04-25 03:26:23,422 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.07ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 95.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.42ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 92.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.41ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 695.78ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 77.2MB in the end (delta: 14.1MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * TraceAbstraction took 59297.80ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 76.4MB in the beginning and 225.7MB in the end (delta: -149.3MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --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-42d8767-m [2025-04-25 03:26:25,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 03:26:25,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-04-25 03:26:25,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 03:26:25,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 03:26:25,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 03:26:25,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 03:26:25,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 03:26:25,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 03:26:25,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 03:26:25,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 03:26:25,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-25 03:26:25,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 03:26:25,136 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:26:25,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 03:26:25,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:26:25,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 03:26:25,137 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 03:26:25,137 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 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-04-25 03:26:25,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 03:26:25,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 03:26:25,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 03:26:25,430 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 03:26:25,431 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 03:26:25,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-25 03:26:26,693 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/29ed3e292/3bf8ab78dcb64a38b40d8996832b409d/FLAGbbeebd999 [2025-04-25 03:26:26,866 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 03:26:26,867 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-04-25 03:26:26,874 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/29ed3e292/3bf8ab78dcb64a38b40d8996832b409d/FLAGbbeebd999 [2025-04-25 03:26:27,695 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/29ed3e292/3bf8ab78dcb64a38b40d8996832b409d [2025-04-25 03:26:27,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 03:26:27,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 03:26:27,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 03:26:27,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 03:26:27,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 03:26:27,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:27,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6a6280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27, skipping insertion in model container [2025-04-25 03:26:27,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:27,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 03:26:27,856 WARN L116 LibraryModelHandler]: 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-25 03:26:27,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 03:26:27,872 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 03:26:27,910 WARN L116 LibraryModelHandler]: 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-bad-three-array-sum-alt.wvr.c[2451,2464] [2025-04-25 03:26:27,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 03:26:27,929 INFO L204 MainTranslator]: Completed translation [2025-04-25 03:26:27,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27 WrapperNode [2025-04-25 03:26:27,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 03:26:27,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 03:26:27,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 03:26:27,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 03:26:27,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:27,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:27,980 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 238 [2025-04-25 03:26:27,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 03:26:27,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 03:26:27,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 03:26:27,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 03:26:27,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:27,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:27,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:27,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:27,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:27,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:28,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:28,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:28,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:28,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 03:26:28,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 03:26:28,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 03:26:28,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 03:26:28,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (1/1) ... [2025-04-25 03:26:28,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:26:28,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:28,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 03:26:28,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 03:26:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 03:26:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-04-25 03:26:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-04-25 03:26:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 03:26:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 03:26:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 03:26:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 03:26:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 03:26:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 03:26:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-25 03:26:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 03:26:28,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 03:26:28,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-04-25 03:26:28,062 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 03:26:28,149 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 03:26:28,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 03:26:28,532 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 03:26:28,532 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 03:26:28,809 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 03:26:28,809 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 03:26:28,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 03:26:28 BoogieIcfgContainer [2025-04-25 03:26:28,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 03:26:28,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 03:26:28,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 03:26:28,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 03:26:28,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 03:26:27" (1/3) ... [2025-04-25 03:26:28,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2e73a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 03:26:28, skipping insertion in model container [2025-04-25 03:26:28,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:26:27" (2/3) ... [2025-04-25 03:26:28,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2e73a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 03:26:28, skipping insertion in model container [2025-04-25 03:26:28,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 03:26:28" (3/3) ... [2025-04-25 03:26:28,824 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-04-25 03:26:28,834 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 03:26:28,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 28 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-25 03:26:28,836 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 03:26:28,885 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-25 03:26:28,917 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 03:26:28,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 03:26:28,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:28,921 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-04-25 03:26:28,923 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-04-25 03:26:28,994 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 03:26:29,002 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 03:26:29,010 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;@4f24d25c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 03:26:29,010 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-25 03:26:29,262 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-04-25 03:26:29,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2012091429, now seen corresponding path program 1 times [2025-04-25 03:26:29,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:29,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970832154] [2025-04-25 03:26:29,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:26:29,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:29,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:29,277 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-04-25 03:26:29,279 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-04-25 03:26:29,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-25 03:26:29,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-25 03:26:29,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:29,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:29,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 03:26:29,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:26:29,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 03:26:29,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:29,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970832154] [2025-04-25 03:26:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970832154] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:26:29,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:26:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 03:26:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405390625] [2025-04-25 03:26:29,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:26:29,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 03:26:29,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:29,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 03:26:29,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 03:26:29,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:29,607 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:29,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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-04-25 03:26:29,608 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:29,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:29,705 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-04-25 03:26:29,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:29,898 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-04-25 03:26:29,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2036822137, now seen corresponding path program 1 times [2025-04-25 03:26:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:29,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213738910] [2025-04-25 03:26:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:26:29,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:29,901 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-04-25 03:26:29,902 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-04-25 03:26:29,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-25 03:26:29,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-25 03:26:29,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:29,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:29,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-25 03:26:29,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:26:30,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 03:26:30,085 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:30,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213738910] [2025-04-25 03:26:30,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213738910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:26:30,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:26:30,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 03:26:30,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990850884] [2025-04-25 03:26:30,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:26:30,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 03:26:30,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:30,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 03:26:30,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-25 03:26:30,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:30,087 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:30,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-04-25 03:26:30,088 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:30,088 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:30,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:30,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:30,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:30,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:30,446 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-04-25 03:26:30,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash 119013592, now seen corresponding path program 1 times [2025-04-25 03:26:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:30,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731164897] [2025-04-25 03:26:30,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:26:30,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:30,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:30,450 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-04-25 03:26:30,451 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-04-25 03:26:30,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-25 03:26:30,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-25 03:26:30,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:30,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:30,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-25 03:26:30,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:26:30,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 03:26:30,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:30,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731164897] [2025-04-25 03:26:30,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731164897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:26:30,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:26:30,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 03:26:30,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362910258] [2025-04-25 03:26:30,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:26:30,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 03:26:30,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:30,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 03:26:30,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-25 03:26:30,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:30,650 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:30,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-04-25 03:26:30,650 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:30,650 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:30,650 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:30,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:30,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:30,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:30,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-25 03:26:31,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:31,043 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-04-25 03:26:31,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:31,043 INFO L85 PathProgramCache]: Analyzing trace with hash -932556493, now seen corresponding path program 1 times [2025-04-25 03:26:31,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:31,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568514501] [2025-04-25 03:26:31,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:26:31,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:31,046 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-04-25 03:26:31,046 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-04-25 03:26:31,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-25 03:26:31,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-25 03:26:31,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:31,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:31,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-25 03:26:31,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:26:31,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 03:26:31,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:31,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568514501] [2025-04-25 03:26:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568514501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:26:31,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:26:31,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 03:26:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691632765] [2025-04-25 03:26:31,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:26:31,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 03:26:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:31,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 03:26:31,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-25 03:26:31,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:31,206 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:31,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-04-25 03:26:31,207 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:31,207 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,207 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,207 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:31,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:31,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,398 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-04-25 03:26:31,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:31,590 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-04-25 03:26:31,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:31,591 INFO L85 PathProgramCache]: Analyzing trace with hash 640182184, now seen corresponding path program 1 times [2025-04-25 03:26:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:31,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654762676] [2025-04-25 03:26:31,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:26:31,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:31,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:31,596 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-04-25 03:26:31,597 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-04-25 03:26:31,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 03:26:31,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 03:26:31,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:31,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:31,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-25 03:26:31,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:26:31,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 03:26:31,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:31,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654762676] [2025-04-25 03:26:31,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654762676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:26:31,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:26:31,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 03:26:31,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160276284] [2025-04-25 03:26:31,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:26:31,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 03:26:31,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:31,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 03:26:31,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-25 03:26:31,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:31,743 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:31,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-04-25 03:26:31,743 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:31,743 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,754 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:31,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:31,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:31,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:32,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:32,145 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-04-25 03:26:32,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:32,146 INFO L85 PathProgramCache]: Analyzing trace with hash 517984662, now seen corresponding path program 1 times [2025-04-25 03:26:32,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:32,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670438147] [2025-04-25 03:26:32,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:26:32,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:32,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:32,148 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:32,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-25 03:26:32,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-25 03:26:32,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 03:26:32,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:32,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:32,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-25 03:26:32,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:26:32,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 03:26:32,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:32,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670438147] [2025-04-25 03:26:32,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670438147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:26:32,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:26:32,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 03:26:32,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306061654] [2025-04-25 03:26:32,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:26:32,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 03:26:32,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:32,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 03:26:32,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-25 03:26:32,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:32,303 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:32,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-04-25 03:26:32,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:32,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:32,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:32,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:32,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:32,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:32,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:32,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:32,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:32,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:32,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:32,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:32,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-25 03:26:32,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:32,645 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-04-25 03:26:32,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash -972968722, now seen corresponding path program 1 times [2025-04-25 03:26:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:32,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060901096] [2025-04-25 03:26:32,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:26:32,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:32,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:32,648 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:32,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-25 03:26:32,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-25 03:26:32,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 03:26:32,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:32,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:32,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-25 03:26:32,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:33,232 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:26:33,233 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 28 treesize of output 20 [2025-04-25 03:26:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:33,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:33,505 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:26:33,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 103 [2025-04-25 03:26:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:34,739 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:34,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060901096] [2025-04-25 03:26:34,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060901096] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:34,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:26:34,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2025-04-25 03:26:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393106075] [2025-04-25 03:26:34,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:34,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-25 03:26:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:34,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-25 03:26:34,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-25 03:26:34,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:34,740 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:34,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 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-04-25 03:26:34,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:34,740 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:34,741 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:34,741 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:34,741 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:34,741 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:34,741 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:35,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:35,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:35,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:35,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:35,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:35,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:35,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:35,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-25 03:26:35,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:35,547 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-04-25 03:26:35,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash -305729328, now seen corresponding path program 2 times [2025-04-25 03:26:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:35,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608392124] [2025-04-25 03:26:35,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 03:26:35,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:35,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:35,550 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:35,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-25 03:26:35,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-25 03:26:35,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 03:26:35,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 03:26:35,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:35,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-25 03:26:35,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:35,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:35,879 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:35,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608392124] [2025-04-25 03:26:35,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608392124] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:35,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:26:35,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-25 03:26:35,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564490872] [2025-04-25 03:26:35,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:35,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 03:26:35,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:35,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 03:26:35,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-25 03:26:35,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:35,880 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:35,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-04-25 03:26:35,880 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:35,880 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:35,881 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:35,881 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:35,881 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:35,881 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:35,881 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:35,881 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:36,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:36,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:36,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:36,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:36,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:36,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:36,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:36,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 03:26:36,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:36,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:36,687 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-04-25 03:26:36,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2071429423, now seen corresponding path program 3 times [2025-04-25 03:26:36,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:36,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378368637] [2025-04-25 03:26:36,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 03:26:36,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:36,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:36,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:36,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-25 03:26:36,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-25 03:26:36,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 03:26:36,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 03:26:36,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:36,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-25 03:26:36,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:36,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:37,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:37,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378368637] [2025-04-25 03:26:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378368637] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:37,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:26:37,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-25 03:26:37,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840366383] [2025-04-25 03:26:37,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:37,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 03:26:37,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:37,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 03:26:37,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-25 03:26:37,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:37,027 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:37,027 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-04-25 03:26:37,027 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:37,027 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:37,027 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:37,027 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:37,027 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:37,027 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:37,027 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:37,027 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 03:26:37,027 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-25 03:26:37,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-25 03:26:37,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:37,855 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-04-25 03:26:37,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1621886632, now seen corresponding path program 4 times [2025-04-25 03:26:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:37,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442604434] [2025-04-25 03:26:37,856 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 03:26:37,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:37,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:37,859 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:37,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-25 03:26:37,909 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-25 03:26:37,948 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 03:26:37,948 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 03:26:37,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:37,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-25 03:26:37,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:38,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:38,146 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:38,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442604434] [2025-04-25 03:26:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442604434] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:38,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:26:38,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-25 03:26:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818104832] [2025-04-25 03:26:38,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:38,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 03:26:38,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:38,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 03:26:38,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-25 03:26:38,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:38,147 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:38,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-25 03:26:38,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:38,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:38,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:38,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:38,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:38,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:38,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:38,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:38,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:38,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 03:26:38,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:38,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-25 03:26:39,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:39,027 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:26:39,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1019859338, now seen corresponding path program 5 times [2025-04-25 03:26:39,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:39,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470104272] [2025-04-25 03:26:39,028 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 03:26:39,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:39,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:39,029 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:39,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-25 03:26:39,078 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-25 03:26:39,171 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 03:26:39,172 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 03:26:39,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:39,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-25 03:26:39,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:39,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:26:39,383 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:39,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470104272] [2025-04-25 03:26:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470104272] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:39,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:26:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-25 03:26:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386326270] [2025-04-25 03:26:39,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:39,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 03:26:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:39,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 03:26:39,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-25 03:26:39,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:39,385 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:39,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-25 03:26:39,385 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-25 03:26:40,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:40,371 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:26:40,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1035530801, now seen corresponding path program 6 times [2025-04-25 03:26:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:40,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35079103] [2025-04-25 03:26:40,371 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-25 03:26:40,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:40,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:40,374 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:40,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-25 03:26:40,429 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-25 03:26:40,478 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 03:26:40,478 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-25 03:26:40,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:40,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-25 03:26:40,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:26:40,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:26:40,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:40,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35079103] [2025-04-25 03:26:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35079103] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:40,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:26:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-25 03:26:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916180834] [2025-04-25 03:26:40,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:40,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 03:26:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:40,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 03:26:40,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-25 03:26:40,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:40,646 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:40,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:40,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:40,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:41,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:41,100 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:26:41,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2089530713, now seen corresponding path program 7 times [2025-04-25 03:26:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:41,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340197758] [2025-04-25 03:26:41,100 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-25 03:26:41,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:41,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:41,102 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:41,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-25 03:26:41,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-25 03:26:41,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-25 03:26:41,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:26:41,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:26:41,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-25 03:26:41,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:26:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-25 03:26:41,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:26:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-25 03:26:41,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 03:26:41,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340197758] [2025-04-25 03:26:41,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340197758] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:26:41,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:26:41,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-04-25 03:26:41,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458149435] [2025-04-25 03:26:41,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-25 03:26:41,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 03:26:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 03:26:41,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 03:26:41,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-25 03:26:41,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:41,388 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:26:41,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:41,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:26:42,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:26:42,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:42,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:42,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 03:26:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:26:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:26:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 03:26:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:26:42,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-25 03:26:42,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-25 03:26:42,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:42,347 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:26:42,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:26:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1796851195, now seen corresponding path program 8 times [2025-04-25 03:26:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 03:26:42,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220704514] [2025-04-25 03:26:42,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 03:26:42,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:26:42,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:26:42,350 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:26:42,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-25 03:26:42,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-25 03:27:50,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-25 03:27:50,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 03:27:50,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:27:50,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-25 03:27:50,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:27:50,871 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-25 03:27:50,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 76 [2025-04-25 03:27:53,850 INFO L325 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2025-04-25 03:27:53,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 431 treesize of output 283 [2025-04-25 03:31:00,069 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-25 03:32:04,318 WARN L849 $PredicateComparison]: unable to prove that (and (let ((.cse6 (bvmul c_~csum~0 (_ bv4294967295 32))) (.cse7 (bvmul (_ bv4294967295 32) c_~bsum~0))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse3 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse4 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse3))) (.cse5 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse2 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse0 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse1 (bvadd .cse2 c_~bsum~0))) (and (bvsle .cse0 (_ bv0 32)) (bvsle .cse1 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse2 .cse3)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse0)))) (bvsge .cse4 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse4 (bvadd (bvneg ((_ sign_extend 32) .cse5)) (_ bv18446744071562067968 64))) (bvsle .cse5 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse11 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse8 ((_ sign_extend 32) .cse11)) (.cse9 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse8 (bvadd (bvneg ((_ sign_extend 32) .cse9)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse10 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse10 (_ bv0 32)) (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse10)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse11 (bvadd (_ bv2147483647 32) (bvneg .cse9))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse13 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse15 (bvadd .cse7 c_~csum~0 .cse13))) (let ((.cse16 ((_ sign_extend 32) .cse15)) (.cse17 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse12 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse14 (bvadd .cse12 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse12 .cse13) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse14 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse15 (bvadd (_ bv2147483647 32) (bvneg .cse14))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse16 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse14)))))))) (bvsge .cse16 (bvadd (bvneg ((_ sign_extend 32) .cse17)) (_ bv18446744071562067968 64))) (bvsle .cse15 (bvadd (_ bv2147483647 32) (bvneg .cse17)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse20 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse18 ((_ sign_extend 32) .cse20)) (.cse19 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse18 (bvadd (bvneg ((_ sign_extend 32) .cse19)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse21 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse20 (bvadd (_ bv2147483647 32) (bvneg .cse21))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse18 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse21)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse19 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse23 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse24 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse22 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse22 (_ bv0 32)) (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse22)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse23 (bvadd (bvneg ((_ sign_extend 32) .cse24)) (_ bv18446744071562067968 64))) (bvsle .cse24 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse27 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse26 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse25 ((_ sign_extend 32) .cse27))) (and (bvsge .cse25 (bvadd (bvneg ((_ sign_extend 32) .cse26)) (_ bv18446744071562067968 64))) (bvsle .cse27 (bvadd (_ bv2147483647 32) (bvneg .cse26))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse28 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse29 ((_ sign_extend 32) .cse28))) (and (bvsle .cse28 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse29 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse28 (_ bv0 32)) (bvsge .cse25 (bvadd (_ bv18446744071562067968 64) (bvneg .cse29))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse34 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse35 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse34))) (.cse36 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse33 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse30 (bvadd .cse33 c_~bsum~0))) (let ((.cse32 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse31 ((_ sign_extend 32) .cse30))) (and (bvsle .cse30 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse31 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse32 (_ bv0 32)) (bvsle .cse30 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse33 .cse34)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse32)))) (bvsge .cse35 (bvadd (_ bv18446744071562067968 64) (bvneg .cse31)))))))) (bvsge .cse35 (bvadd (bvneg ((_ sign_extend 32) .cse36)) (_ bv18446744071562067968 64))) (bvsle .cse36 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse43 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse40 (bvadd .cse7 c_~csum~0 .cse43))) (let ((.cse41 ((_ sign_extend 32) .cse40)) (.cse44 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse42 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse37 (bvadd c_~csum~0 .cse42 .cse43)) (.cse38 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse39 (bvadd .cse42 c_~bsum~0))) (and (bvsle .cse37 (bvadd (bvneg .cse38) (_ bv2147483647 32))) (bvsle .cse39 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse40 (bvadd (_ bv2147483647 32) (bvneg .cse39))) (bvsge ((_ sign_extend 32) .cse37) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse38)))) (bvsge .cse41 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse39)))))))) (bvsge .cse41 (bvadd (bvneg ((_ sign_extend 32) .cse44)) (_ bv18446744071562067968 64))) (bvsle .cse40 (bvadd (_ bv2147483647 32) (bvneg .cse44)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse52 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse53 (bvadd .cse7 c_~csum~0 .cse52))) (let ((.cse45 ((_ sign_extend 32) .cse53)) (.cse46 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse45 (bvadd (bvneg ((_ sign_extend 32) .cse46)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse51 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse49 (bvadd .cse51 c_~bsum~0))) (let ((.cse47 (bvadd c_~csum~0 .cse51 .cse52)) (.cse48 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse50 ((_ sign_extend 32) .cse49))) (and (bvsle .cse47 (bvadd (bvneg .cse48) (_ bv2147483647 32))) (bvsle .cse49 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse50 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse49 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse47) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse48)))) (bvsge .cse45 (bvadd (_ bv18446744071562067968 64) (bvneg .cse50)))))))) (bvsle .cse53 (bvadd (_ bv2147483647 32) (bvneg .cse46)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse57 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse55 ((_ sign_extend 32) .cse57)) (.cse56 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse54 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse54 (_ bv0 32)) (bvsge .cse55 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse54)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse55 (bvadd (bvneg ((_ sign_extend 32) .cse56)) (_ bv18446744071562067968 64))) (bvsle .cse57 (bvadd (_ bv2147483647 32) (bvneg .cse56))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse59 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse61 (bvadd .cse7 c_~csum~0 .cse59))) (let ((.cse63 ((_ sign_extend 32) .cse61)) (.cse64 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse58 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse60 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse62 (bvadd .cse58 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse58 .cse59) (bvadd (bvneg .cse60) (_ bv2147483647 32))) (bvsge .cse60 (_ bv0 32)) (bvsle .cse61 (bvadd (_ bv2147483647 32) (bvneg .cse62))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse63 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse62)))))))) (bvsge .cse63 (bvadd (bvneg ((_ sign_extend 32) .cse64)) (_ bv18446744071562067968 64))) (bvsle .cse61 (bvadd (_ bv2147483647 32) (bvneg .cse64)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse66 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse67 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse65 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse65 (_ bv0 32)) (bvsge .cse66 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse65))))))) (bvsge .cse66 (bvadd (bvneg ((_ sign_extend 32) .cse67)) (_ bv18446744071562067968 64))) (bvsle .cse67 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse69 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse74 (bvadd .cse7 c_~csum~0 .cse69))) (let ((.cse72 ((_ sign_extend 32) .cse74)) (.cse73 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse68 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse70 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse71 (bvadd .cse68 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse68 .cse69) (bvadd (bvneg .cse70) (_ bv2147483647 32))) (bvsge .cse70 (_ bv0 32)) (bvsle .cse71 (_ bv0 32)) (bvsge .cse72 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse71)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse72 (bvadd (bvneg ((_ sign_extend 32) .cse73)) (_ bv18446744071562067968 64))) (bvsle .cse74 (bvadd (_ bv2147483647 32) (bvneg .cse73)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse75 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse76 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse75 (bvadd (bvneg ((_ sign_extend 32) .cse76)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse77 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse78 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse77 (_ bv0 32)) (bvsle .cse77 (_ bv0 32)) (bvsle .cse78 (_ bv0 32)) (bvsge .cse75 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse78)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse76 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse85 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse81 (bvadd .cse7 c_~csum~0 .cse85))) (let ((.cse80 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse79 ((_ sign_extend 32) .cse81))) (and (bvsge .cse79 (bvadd (bvneg ((_ sign_extend 32) .cse80)) (_ bv18446744071562067968 64))) (bvsle .cse81 (bvadd (_ bv2147483647 32) (bvneg .cse80))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse84 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse82 (bvadd .cse84 c_~bsum~0))) (let ((.cse83 ((_ sign_extend 32) .cse82))) (and (bvsle .cse82 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse83 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse82 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse84 .cse85)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse79 (bvadd (_ bv18446744071562067968 64) (bvneg .cse83))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse90 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse91 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse90))) (.cse92 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse89 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse88 (bvadd .cse89 c_~bsum~0))) (let ((.cse87 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse86 ((_ sign_extend 32) .cse88))) (and (bvsge .cse86 .cse87) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse87) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse88 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse89 .cse90)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse91 (bvadd (_ bv18446744071562067968 64) (bvneg .cse86)))))))) (bvsge .cse91 (bvadd (bvneg ((_ sign_extend 32) .cse92)) (_ bv18446744071562067968 64))) (bvsle .cse92 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse98 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse95 (bvadd .cse7 c_~csum~0 .cse98))) (let ((.cse94 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse93 ((_ sign_extend 32) .cse95))) (and (bvsge .cse93 (bvadd (bvneg ((_ sign_extend 32) .cse94)) (_ bv18446744071562067968 64))) (bvsle .cse95 (bvadd (_ bv2147483647 32) (bvneg .cse94))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse97 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse96 (bvadd .cse97 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse96 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse97 .cse98)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse93 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse96)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse102 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse106 (bvadd .cse7 c_~csum~0 .cse102))) (let ((.cse99 ((_ sign_extend 32) .cse106)) (.cse100 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse99 (bvadd (bvneg ((_ sign_extend 32) .cse100)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse101 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse105 (bvadd .cse101 c_~bsum~0))) (let ((.cse103 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse104 ((_ sign_extend 32) .cse105))) (and (bvsle (bvadd c_~csum~0 .cse101 .cse102) (bvadd (bvneg .cse103) (_ bv2147483647 32))) (bvsge .cse103 (_ bv0 32)) (bvsge .cse104 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse105 (_ bv0 32)) (bvsge .cse99 (bvadd (_ bv18446744071562067968 64) (bvneg .cse104)))))))) (bvsle .cse106 (bvadd (_ bv2147483647 32) (bvneg .cse100)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse109 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse108 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse107 ((_ sign_extend 32) .cse109))) (and (bvsge .cse107 (bvadd (bvneg ((_ sign_extend 32) .cse108)) (_ bv18446744071562067968 64))) (bvsle .cse109 (bvadd (_ bv2147483647 32) (bvneg .cse108))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse110 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse111 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse112 ((_ sign_extend 32) .cse110))) (and (bvsle .cse110 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse111 (_ bv0 32)) (bvsge .cse112 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse111 (_ bv0 32)) (bvsle .cse110 (_ bv0 32)) (bvsge .cse107 (bvadd (_ bv18446744071562067968 64) (bvneg .cse112))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse115 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse114 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse113 ((_ sign_extend 32) .cse115))) (and (bvsge .cse113 (bvadd (bvneg ((_ sign_extend 32) .cse114)) (_ bv18446744071562067968 64))) (bvsle .cse115 (bvadd (_ bv2147483647 32) (bvneg .cse114))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse116 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse117 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse116 (_ bv0 32)) (bvsle .cse116 (_ bv0 32)) (bvsle .cse117 (_ bv0 32)) (bvsge .cse113 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse117)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse120 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse121 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse118 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse119 ((_ sign_extend 32) .cse118))) (and (bvsle .cse118 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse119 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse118 (_ bv0 32)) (bvsge .cse120 (bvadd (_ bv18446744071562067968 64) (bvneg .cse119))))))) (bvsge .cse120 (bvadd (bvneg ((_ sign_extend 32) .cse121)) (_ bv18446744071562067968 64))) (bvsle .cse121 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse124 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse125 ((_ sign_extend 32) .cse124)) (.cse126 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse123 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (.cse122 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse122 .cse123) (bvsle .cse124 (bvadd (_ bv2147483647 32) (bvneg .cse122))) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_11 .cse123) (bvsge .cse125 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse122))))))) (bvsge .cse125 (bvadd (bvneg ((_ sign_extend 32) .cse126)) (_ bv18446744071562067968 64))) (bvsle .cse124 (bvadd (_ bv2147483647 32) (bvneg .cse126))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse131 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse129 ((_ sign_extend 32) .cse131)) (.cse130 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse127 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse128 ((_ sign_extend 32) .cse127))) (and (bvsle .cse127 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse128 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse127 (_ bv0 32)) (bvsge .cse129 (bvadd (_ bv18446744071562067968 64) (bvneg .cse128))))))) (bvsge .cse129 (bvadd (bvneg ((_ sign_extend 32) .cse130)) (_ bv18446744071562067968 64))) (bvsle .cse131 (bvadd (_ bv2147483647 32) (bvneg .cse130))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse137 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse132 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse137))) (.cse133 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse132 (bvadd (bvneg ((_ sign_extend 32) .cse133)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse136 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse134 (bvadd .cse136 c_~bsum~0))) (let ((.cse135 ((_ sign_extend 32) .cse134))) (and (bvsle .cse134 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse135 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse134 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse136 .cse137)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse132 (bvadd (_ bv18446744071562067968 64) (bvneg .cse135)))))))) (bvsle .cse133 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse144 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse140 (bvadd .cse7 c_~csum~0 .cse144))) (let ((.cse142 ((_ sign_extend 32) .cse140)) (.cse145 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse143 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse138 (bvadd c_~csum~0 .cse143 .cse144)) (.cse139 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse141 (bvadd .cse143 c_~bsum~0))) (and (bvsle .cse138 (bvadd (bvneg .cse139) (_ bv2147483647 32))) (bvsle .cse140 (bvadd (_ bv2147483647 32) (bvneg .cse141))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse138) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse139)))) (bvsge .cse142 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse141)))))))) (bvsge .cse142 (bvadd (bvneg ((_ sign_extend 32) .cse145)) (_ bv18446744071562067968 64))) (bvsle .cse145 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse150 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse153 (bvadd .cse7 c_~csum~0 .cse150))) (let ((.cse151 ((_ sign_extend 32) .cse153)) (.cse152 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse149 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse146 (bvadd .cse149 c_~bsum~0))) (let ((.cse148 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse147 ((_ sign_extend 32) .cse146))) (and (bvsle .cse146 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse147 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse148 (_ bv0 32)) (bvsle .cse146 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse149 .cse150)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse148)))) (bvsge .cse151 (bvadd (_ bv18446744071562067968 64) (bvneg .cse147)))))))) (bvsge .cse151 (bvadd (bvneg ((_ sign_extend 32) .cse152)) (_ bv18446744071562067968 64))) (bvsle .cse153 (bvadd (_ bv2147483647 32) (bvneg .cse152)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse158 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse154 ((_ sign_extend 32) .cse158)) (.cse155 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse154 (bvadd (bvneg ((_ sign_extend 32) .cse155)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse157 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse156 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse156 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse157 (_ bv0 32)) (bvsle .cse158 (bvadd (_ bv2147483647 32) (bvneg .cse156))) (bvsle .cse157 (_ bv0 32)) (bvsge .cse154 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse156))))))) (bvsle .cse155 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse166 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse159 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse166))) (.cse160 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse159 (bvadd (bvneg ((_ sign_extend 32) .cse160)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse165 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse163 (bvadd .cse165 c_~bsum~0))) (let ((.cse161 (bvadd c_~csum~0 .cse165 .cse166)) (.cse162 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse164 ((_ sign_extend 32) .cse163))) (and (bvsle .cse161 (bvadd (bvneg .cse162) (_ bv2147483647 32))) (bvsle .cse163 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse164 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse163 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse161) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse162)))) (bvsge .cse159 (bvadd (_ bv18446744071562067968 64) (bvneg .cse164)))))))) (bvsle .cse160 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse171 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse167 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse171))) (.cse168 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse167 (bvadd (bvneg ((_ sign_extend 32) .cse168)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse170 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse169 (bvadd .cse170 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse169 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse170 .cse171)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse167 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse169)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse168 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse179 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse174 (bvadd .cse7 c_~csum~0 .cse179))) (let ((.cse173 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse172 ((_ sign_extend 32) .cse174))) (and (bvsge .cse172 (bvadd (bvneg ((_ sign_extend 32) .cse173)) (_ bv18446744071562067968 64))) (bvsle .cse174 (bvadd (_ bv2147483647 32) (bvneg .cse173))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse178 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse175 (bvadd c_~csum~0 .cse178 .cse179)) (.cse176 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse177 (bvadd .cse178 c_~bsum~0))) (and (bvsle .cse175 (bvadd (bvneg .cse176) (_ bv2147483647 32))) (bvsle .cse177 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse175) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse176)))) (bvsge .cse172 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse177)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse182 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse181 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse180 ((_ sign_extend 32) .cse182))) (and (bvsge .cse180 (bvadd (bvneg ((_ sign_extend 32) .cse181)) (_ bv18446744071562067968 64))) (bvsle .cse182 (bvadd (_ bv2147483647 32) (bvneg .cse181))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse183 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse184 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse183 (_ bv0 32)) (bvsle .cse182 (bvadd (_ bv2147483647 32) (bvneg .cse184))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse183 (_ bv0 32)) (bvsge .cse180 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse184)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse187 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse186 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse185 ((_ sign_extend 32) .cse187))) (and (bvsge .cse185 (bvadd (bvneg ((_ sign_extend 32) .cse186)) (_ bv18446744071562067968 64))) (bvsle .cse186 (_ bv0 32)) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse188 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse187 (bvadd (_ bv2147483647 32) (bvneg .cse188))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse185 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse188))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse194 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse192 ((_ sign_extend 32) .cse194)) (.cse193 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse191 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse189 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse190 ((_ sign_extend 32) .cse191))) (and (bvsge .cse189 (_ bv0 32)) (bvsge .cse190 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse189 (_ bv0 32)) (bvsle .cse191 (_ bv0 32)) (bvsge .cse192 (bvadd (_ bv18446744071562067968 64) (bvneg .cse190))))))) (bvsge .cse192 (bvadd (bvneg ((_ sign_extend 32) .cse193)) (_ bv18446744071562067968 64))) (bvsle .cse194 (bvadd (_ bv2147483647 32) (bvneg .cse193))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse196 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse197 ((_ sign_extend 32) .cse196)) (.cse198 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse195 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse195 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse196 (bvadd (_ bv2147483647 32) (bvneg .cse195))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse197 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse195))))))) (bvsge .cse197 (bvadd (bvneg ((_ sign_extend 32) .cse198)) (_ bv18446744071562067968 64))) (bvsle .cse198 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse200 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse203 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse200))) (.cse204 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse199 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse201 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse202 (bvadd .cse199 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse199 .cse200) (bvadd (bvneg .cse201) (_ bv2147483647 32))) (bvsge .cse201 (_ bv0 32)) (bvsle .cse202 (_ bv0 32)) (bvsge .cse203 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse202)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse203 (bvadd (bvneg ((_ sign_extend 32) .cse204)) (_ bv18446744071562067968 64))) (bvsle .cse204 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse206 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse207 (bvadd .cse7 c_~csum~0 .cse206))) (let ((.cse209 ((_ sign_extend 32) .cse207)) (.cse210 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse205 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse208 (bvadd .cse205 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse205 .cse206) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse207 (bvadd (_ bv2147483647 32) (bvneg .cse208))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse209 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse208)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse209 (bvadd (bvneg ((_ sign_extend 32) .cse210)) (_ bv18446744071562067968 64))) (bvsle .cse210 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse216 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse213 (bvadd .cse7 c_~csum~0 .cse216))) (let ((.cse211 ((_ sign_extend 32) .cse213)) (.cse212 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse211 (bvadd (bvneg ((_ sign_extend 32) .cse212)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse215 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse214 (bvadd .cse215 c_~bsum~0))) (and (bvsle .cse213 (bvadd (_ bv2147483647 32) (bvneg .cse214))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse215 .cse216)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse211 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse214)))))))) (bvsle .cse212 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse221 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse217 ((_ sign_extend 32) .cse221)) (.cse218 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse217 (bvadd (bvneg ((_ sign_extend 32) .cse218)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse219 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse220 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse219 (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse219 (_ bv0 32)) (bvsle .cse220 (_ bv0 32)) (bvsge .cse217 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse220)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse221 (bvadd (_ bv2147483647 32) (bvneg .cse218))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse224 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse222 ((_ sign_extend 32) .cse224)) (.cse223 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse222 (bvadd (bvneg ((_ sign_extend 32) .cse223)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse225 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse224 (bvadd (_ bv2147483647 32) (bvneg .cse225))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse222 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse225)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse223 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse232 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse226 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse232))) (.cse227 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse226 (bvadd (bvneg ((_ sign_extend 32) .cse227)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse231 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse228 (bvadd c_~csum~0 .cse231 .cse232)) (.cse229 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse230 (bvadd .cse231 c_~bsum~0))) (and (bvsle .cse228 (bvadd (bvneg .cse229) (_ bv2147483647 32))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse230 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse228) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse229)))) (bvsge .cse226 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse230)))))))) (bvsle .cse227 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse234 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse235 ((_ sign_extend 32) .cse234)) (.cse236 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse233 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse233 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse234 (bvadd (_ bv2147483647 32) (bvneg .cse233))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse235 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse233))))))) (bvsge .cse235 (bvadd (bvneg ((_ sign_extend 32) .cse236)) (_ bv18446744071562067968 64))) (bvsle .cse234 (bvadd (_ bv2147483647 32) (bvneg .cse236))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse243 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse237 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse243))) (.cse238 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse237 (bvadd (bvneg ((_ sign_extend 32) .cse238)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse242 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse239 (bvadd c_~csum~0 .cse242 .cse243)) (.cse240 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse241 (bvadd .cse242 c_~bsum~0))) (and (bvsle .cse239 (bvadd (bvneg .cse240) (_ bv2147483647 32))) (bvsle .cse241 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse239) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse240)))) (bvsge .cse237 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse241)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse238 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse246 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse245 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse244 ((_ sign_extend 32) .cse246))) (and (bvsge .cse244 (bvadd (bvneg ((_ sign_extend 32) .cse245)) (_ bv18446744071562067968 64))) (bvsle .cse246 (bvadd (_ bv2147483647 32) (bvneg .cse245))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse248 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse247 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse247 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse248 (_ bv0 32)) (bvsle .cse246 (bvadd (_ bv2147483647 32) (bvneg .cse247))) (bvsle .cse248 (_ bv0 32)) (bvsge .cse244 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse247))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse253 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse256 (bvadd .cse7 c_~csum~0 .cse253))) (let ((.cse254 ((_ sign_extend 32) .cse256)) (.cse255 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse252 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse251 (bvadd .cse252 c_~bsum~0))) (let ((.cse250 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse249 ((_ sign_extend 32) .cse251))) (and (bvsge .cse249 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse250 (_ bv0 32)) (bvsle .cse251 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse252 .cse253)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse250)))) (bvsge .cse254 (bvadd (_ bv18446744071562067968 64) (bvneg .cse249)))))))) (bvsge .cse254 (bvadd (bvneg ((_ sign_extend 32) .cse255)) (_ bv18446744071562067968 64))) (bvsle .cse256 (bvadd (_ bv2147483647 32) (bvneg .cse255)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse258 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse262 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse258))) (.cse263 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse257 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse260 (bvadd .cse257 c_~bsum~0))) (let ((.cse259 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse261 ((_ sign_extend 32) .cse260))) (and (bvsle (bvadd c_~csum~0 .cse257 .cse258) (bvadd (bvneg .cse259) (_ bv2147483647 32))) (bvsle .cse260 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse259 (_ bv0 32)) (bvsge .cse261 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse260 (_ bv0 32)) (bvsge .cse262 (bvadd (_ bv18446744071562067968 64) (bvneg .cse261)))))))) (bvsge .cse262 (bvadd (bvneg ((_ sign_extend 32) .cse263)) (_ bv18446744071562067968 64))) (bvsle .cse263 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse268 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse266 (bvadd .cse7 c_~csum~0 .cse268))) (let ((.cse265 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse264 ((_ sign_extend 32) .cse266))) (and (bvsge .cse264 (bvadd (bvneg ((_ sign_extend 32) .cse265)) (_ bv18446744071562067968 64))) (bvsle .cse266 (bvadd (_ bv2147483647 32) (bvneg .cse265))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse267 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse269 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse270 (bvadd .cse267 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse267 .cse268) (bvadd (bvneg .cse269) (_ bv2147483647 32))) (bvsle .cse270 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse269 (_ bv0 32)) (bvsle .cse266 (bvadd (_ bv2147483647 32) (bvneg .cse270))) (bvsge .cse264 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse270))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse273 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse271 ((_ sign_extend 32) .cse273)) (.cse272 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse271 (bvadd (bvneg ((_ sign_extend 32) .cse272)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse274 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse273 (bvadd (_ bv2147483647 32) (bvneg .cse274))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse271 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse274)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse273 (bvadd (_ bv2147483647 32) (bvneg .cse272))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse276 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse277 (bvadd .cse7 c_~csum~0 .cse276))) (let ((.cse279 ((_ sign_extend 32) .cse277)) (.cse280 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse275 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse278 (bvadd .cse275 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse275 .cse276) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse277 (bvadd (_ bv2147483647 32) (bvneg .cse278))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse279 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse278)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse279 (bvadd (bvneg ((_ sign_extend 32) .cse280)) (_ bv18446744071562067968 64))) (bvsle .cse277 (bvadd (_ bv2147483647 32) (bvneg .cse280)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse286 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse287 (bvadd .cse7 c_~csum~0 .cse286))) (let ((.cse281 ((_ sign_extend 32) .cse287)) (.cse282 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse281 (bvadd (bvneg ((_ sign_extend 32) .cse282)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse285 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse283 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse284 (bvadd .cse285 c_~bsum~0))) (and (bvsle .cse283 (_ bv0 32)) (bvsle v_arrayElimCell_11 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse284 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse285 .cse286)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse283)))) (bvsge .cse281 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse284)))))))) (bvsle .cse287 (bvadd (_ bv2147483647 32) (bvneg .cse282)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse294 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse288 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse294))) (.cse289 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse288 (bvadd (bvneg ((_ sign_extend 32) .cse289)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse293 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse290 (bvadd c_~csum~0 .cse293 .cse294)) (.cse291 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse292 (bvadd .cse293 c_~bsum~0))) (and (bvsle .cse290 (bvadd (bvneg .cse291) (_ bv2147483647 32))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse292 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse290) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse291)))) (bvsge .cse288 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse292)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse289 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse301 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse299 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse301))) (.cse302 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse300 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse297 (bvadd .cse300 c_~bsum~0))) (let ((.cse295 (bvadd c_~csum~0 .cse300 .cse301)) (.cse296 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse298 ((_ sign_extend 32) .cse297))) (and (bvsle .cse295 (bvadd (bvneg .cse296) (_ bv2147483647 32))) (bvsle .cse297 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse298 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse297 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse295) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse296)))) (bvsge .cse299 (bvadd (_ bv18446744071562067968 64) (bvneg .cse298)))))))) (bvsge .cse299 (bvadd (bvneg ((_ sign_extend 32) .cse302)) (_ bv18446744071562067968 64))) (bvsle .cse302 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse306 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse303 ((_ sign_extend 32) .cse306)) (.cse304 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse303 (bvadd (bvneg ((_ sign_extend 32) .cse304)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse305 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse305 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse306 (bvadd (_ bv2147483647 32) (bvneg .cse305))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse303 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse305))))))) (bvsle .cse304 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse313 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse310 (bvadd .cse7 c_~csum~0 .cse313))) (let ((.cse311 ((_ sign_extend 32) .cse310)) (.cse314 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse312 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse307 (bvadd c_~csum~0 .cse312 .cse313)) (.cse308 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse309 (bvadd .cse312 c_~bsum~0))) (and (bvsle .cse307 (bvadd (bvneg .cse308) (_ bv2147483647 32))) (bvsle .cse309 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse310 (bvadd (_ bv2147483647 32) (bvneg .cse309))) (bvsge ((_ sign_extend 32) .cse307) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse308)))) (bvsge .cse311 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse309)))))))) (bvsge .cse311 (bvadd (bvneg ((_ sign_extend 32) .cse314)) (_ bv18446744071562067968 64))) (bvsle .cse314 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse315 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse316 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse315 (bvadd (bvneg ((_ sign_extend 32) .cse316)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse317 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse318 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse319 ((_ sign_extend 32) .cse317))) (and (bvsle .cse317 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse318 (_ bv0 32)) (bvsge .cse319 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse318 (_ bv0 32)) (bvsle .cse317 (_ bv0 32)) (bvsge .cse315 (bvadd (_ bv18446744071562067968 64) (bvneg .cse319))))))) (bvsle .cse316 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse321 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse327 (bvadd .cse7 c_~csum~0 .cse321))) (let ((.cse325 ((_ sign_extend 32) .cse327)) (.cse326 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse320 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse323 (bvadd .cse320 c_~bsum~0))) (let ((.cse322 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse324 ((_ sign_extend 32) .cse323))) (and (bvsle (bvadd c_~csum~0 .cse320 .cse321) (bvadd (bvneg .cse322) (_ bv2147483647 32))) (bvsle .cse323 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse322 (_ bv0 32)) (bvsge .cse324 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse323 (_ bv0 32)) (bvsge .cse325 (bvadd (_ bv18446744071562067968 64) (bvneg .cse324)))))))) (bvsge .cse325 (bvadd (bvneg ((_ sign_extend 32) .cse326)) (_ bv18446744071562067968 64))) (bvsle .cse327 (bvadd (_ bv2147483647 32) (bvneg .cse326)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse329 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse331 (bvadd .cse7 c_~csum~0 .cse329))) (let ((.cse332 ((_ sign_extend 32) .cse331)) (.cse333 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse328 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse330 (bvadd .cse328 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse328 .cse329) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse330 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse331 (bvadd (_ bv2147483647 32) (bvneg .cse330))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse332 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse330)))))))) (bvsge .cse332 (bvadd (bvneg ((_ sign_extend 32) .cse333)) (_ bv18446744071562067968 64))) (bvsle .cse333 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse341 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse342 (bvadd .cse7 c_~csum~0 .cse341))) (let ((.cse334 ((_ sign_extend 32) .cse342)) (.cse335 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse334 (bvadd (bvneg ((_ sign_extend 32) .cse335)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse340 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse339 (bvadd .cse340 c_~bsum~0))) (let ((.cse336 (bvadd c_~csum~0 .cse340 .cse341)) (.cse337 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse338 ((_ sign_extend 32) .cse339))) (and (bvsle .cse336 (bvadd (bvneg .cse337) (_ bv2147483647 32))) (bvsge .cse338 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse339 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse336) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse337)))) (bvsge .cse334 (bvadd (_ bv18446744071562067968 64) (bvneg .cse338)))))))) (bvsle .cse342 (bvadd (_ bv2147483647 32) (bvneg .cse335)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse346 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse349 (bvadd .cse7 c_~csum~0 .cse346))) (let ((.cse343 ((_ sign_extend 32) .cse349)) (.cse344 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse343 (bvadd (bvneg ((_ sign_extend 32) .cse344)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse345 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse347 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse348 (bvadd .cse345 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse345 .cse346) (bvadd (bvneg .cse347) (_ bv2147483647 32))) (bvsle .cse348 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse347 (_ bv0 32)) (bvsle .cse349 (bvadd (_ bv2147483647 32) (bvneg .cse348))) (bvsge .cse343 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse348)))))))) (bvsle .cse344 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse356 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse352 (bvadd .cse7 c_~csum~0 .cse356))) (let ((.cse350 ((_ sign_extend 32) .cse352)) (.cse351 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse350 (bvadd (bvneg ((_ sign_extend 32) .cse351)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse355 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse354 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse353 (bvadd .cse355 c_~bsum~0))) (and (bvsle .cse352 (bvadd (_ bv2147483647 32) (bvneg .cse353))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse354 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse355 .cse356)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse354)))) (bvsge .cse350 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse353)))))))) (bvsle .cse352 (bvadd (_ bv2147483647 32) (bvneg .cse351)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse363 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse360 (bvadd .cse7 c_~csum~0 .cse363))) (let ((.cse357 ((_ sign_extend 32) .cse360)) (.cse358 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse357 (bvadd (bvneg ((_ sign_extend 32) .cse358)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse362 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse361 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse359 (bvadd .cse362 c_~bsum~0))) (and (bvsle .cse359 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse360 (bvadd (_ bv2147483647 32) (bvneg .cse359))) (bvsle .cse361 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse362 .cse363)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse361)))) (bvsge .cse357 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse359)))))))) (bvsle .cse358 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse370 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse366 (bvadd .cse7 c_~csum~0 .cse370))) (let ((.cse368 ((_ sign_extend 32) .cse366)) (.cse371 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse369 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse364 (bvadd c_~csum~0 .cse369 .cse370)) (.cse365 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse367 (bvadd .cse369 c_~bsum~0))) (and (bvsle .cse364 (bvadd (bvneg .cse365) (_ bv2147483647 32))) (bvsle .cse366 (bvadd (_ bv2147483647 32) (bvneg .cse367))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse364) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse365)))) (bvsge .cse368 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse367)))))))) (bvsge .cse368 (bvadd (bvneg ((_ sign_extend 32) .cse371)) (_ bv18446744071562067968 64))) (bvsle .cse366 (bvadd (_ bv2147483647 32) (bvneg .cse371)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse375 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse372 ((_ sign_extend 32) .cse375)) (.cse373 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse372 (bvadd (bvneg ((_ sign_extend 32) .cse373)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse374 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse376 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse374 (_ bv0 32)) (bvsle .cse375 (bvadd (_ bv2147483647 32) (bvneg .cse376))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse374 (_ bv0 32)) (bvsge .cse372 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse376))))))) (bvsle .cse375 (bvadd (_ bv2147483647 32) (bvneg .cse373))))))))) (= c_~csum~0 (bvadd c_~asum~0 c_~bsum~0))) is different from false [2025-04-25 03:34:38,094 WARN L849 $PredicateComparison]: unable to prove that (and (let ((.cse6 (bvmul c_~csum~0 (_ bv4294967295 32))) (.cse7 (bvmul (_ bv4294967295 32) c_~bsum~0))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse3 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse4 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse3))) (.cse5 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse2 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse0 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse1 (bvadd .cse2 c_~bsum~0))) (and (bvsle .cse0 (_ bv0 32)) (bvsle .cse1 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse2 .cse3)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse0)))) (bvsge .cse4 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse4 (bvadd (bvneg ((_ sign_extend 32) .cse5)) (_ bv18446744071562067968 64))) (bvsle .cse5 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse11 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse8 ((_ sign_extend 32) .cse11)) (.cse9 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse8 (bvadd (bvneg ((_ sign_extend 32) .cse9)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse10 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse10 (_ bv0 32)) (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse10)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse11 (bvadd (_ bv2147483647 32) (bvneg .cse9))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse13 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse15 (bvadd .cse7 c_~csum~0 .cse13))) (let ((.cse16 ((_ sign_extend 32) .cse15)) (.cse17 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse12 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse14 (bvadd .cse12 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse12 .cse13) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse14 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse15 (bvadd (_ bv2147483647 32) (bvneg .cse14))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse16 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse14)))))))) (bvsge .cse16 (bvadd (bvneg ((_ sign_extend 32) .cse17)) (_ bv18446744071562067968 64))) (bvsle .cse15 (bvadd (_ bv2147483647 32) (bvneg .cse17)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse20 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse18 ((_ sign_extend 32) .cse20)) (.cse19 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse18 (bvadd (bvneg ((_ sign_extend 32) .cse19)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse21 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse20 (bvadd (_ bv2147483647 32) (bvneg .cse21))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse18 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse21)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse19 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse23 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse24 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse22 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse22 (_ bv0 32)) (bvsge .cse23 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse22)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse23 (bvadd (bvneg ((_ sign_extend 32) .cse24)) (_ bv18446744071562067968 64))) (bvsle .cse24 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse27 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse26 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse25 ((_ sign_extend 32) .cse27))) (and (bvsge .cse25 (bvadd (bvneg ((_ sign_extend 32) .cse26)) (_ bv18446744071562067968 64))) (bvsle .cse27 (bvadd (_ bv2147483647 32) (bvneg .cse26))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse28 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse29 ((_ sign_extend 32) .cse28))) (and (bvsle .cse28 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse29 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse28 (_ bv0 32)) (bvsge .cse25 (bvadd (_ bv18446744071562067968 64) (bvneg .cse29))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse34 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse35 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse34))) (.cse36 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse33 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse30 (bvadd .cse33 c_~bsum~0))) (let ((.cse32 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse31 ((_ sign_extend 32) .cse30))) (and (bvsle .cse30 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse31 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse32 (_ bv0 32)) (bvsle .cse30 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse33 .cse34)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse32)))) (bvsge .cse35 (bvadd (_ bv18446744071562067968 64) (bvneg .cse31)))))))) (bvsge .cse35 (bvadd (bvneg ((_ sign_extend 32) .cse36)) (_ bv18446744071562067968 64))) (bvsle .cse36 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse43 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse40 (bvadd .cse7 c_~csum~0 .cse43))) (let ((.cse41 ((_ sign_extend 32) .cse40)) (.cse44 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse42 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse37 (bvadd c_~csum~0 .cse42 .cse43)) (.cse38 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse39 (bvadd .cse42 c_~bsum~0))) (and (bvsle .cse37 (bvadd (bvneg .cse38) (_ bv2147483647 32))) (bvsle .cse39 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse40 (bvadd (_ bv2147483647 32) (bvneg .cse39))) (bvsge ((_ sign_extend 32) .cse37) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse38)))) (bvsge .cse41 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse39)))))))) (bvsge .cse41 (bvadd (bvneg ((_ sign_extend 32) .cse44)) (_ bv18446744071562067968 64))) (bvsle .cse40 (bvadd (_ bv2147483647 32) (bvneg .cse44)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse52 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse53 (bvadd .cse7 c_~csum~0 .cse52))) (let ((.cse45 ((_ sign_extend 32) .cse53)) (.cse46 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse45 (bvadd (bvneg ((_ sign_extend 32) .cse46)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse51 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse49 (bvadd .cse51 c_~bsum~0))) (let ((.cse47 (bvadd c_~csum~0 .cse51 .cse52)) (.cse48 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse50 ((_ sign_extend 32) .cse49))) (and (bvsle .cse47 (bvadd (bvneg .cse48) (_ bv2147483647 32))) (bvsle .cse49 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse50 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse49 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse47) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse48)))) (bvsge .cse45 (bvadd (_ bv18446744071562067968 64) (bvneg .cse50)))))))) (bvsle .cse53 (bvadd (_ bv2147483647 32) (bvneg .cse46)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse57 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse55 ((_ sign_extend 32) .cse57)) (.cse56 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse54 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse54 (_ bv0 32)) (bvsge .cse55 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse54)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse55 (bvadd (bvneg ((_ sign_extend 32) .cse56)) (_ bv18446744071562067968 64))) (bvsle .cse57 (bvadd (_ bv2147483647 32) (bvneg .cse56))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse59 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse61 (bvadd .cse7 c_~csum~0 .cse59))) (let ((.cse63 ((_ sign_extend 32) .cse61)) (.cse64 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse58 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse60 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse62 (bvadd .cse58 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse58 .cse59) (bvadd (bvneg .cse60) (_ bv2147483647 32))) (bvsge .cse60 (_ bv0 32)) (bvsle .cse61 (bvadd (_ bv2147483647 32) (bvneg .cse62))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse63 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse62)))))))) (bvsge .cse63 (bvadd (bvneg ((_ sign_extend 32) .cse64)) (_ bv18446744071562067968 64))) (bvsle .cse61 (bvadd (_ bv2147483647 32) (bvneg .cse64)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse66 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse67 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse65 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse65 (_ bv0 32)) (bvsge .cse66 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse65))))))) (bvsge .cse66 (bvadd (bvneg ((_ sign_extend 32) .cse67)) (_ bv18446744071562067968 64))) (bvsle .cse67 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse69 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse74 (bvadd .cse7 c_~csum~0 .cse69))) (let ((.cse72 ((_ sign_extend 32) .cse74)) (.cse73 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse68 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse70 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse71 (bvadd .cse68 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse68 .cse69) (bvadd (bvneg .cse70) (_ bv2147483647 32))) (bvsge .cse70 (_ bv0 32)) (bvsle .cse71 (_ bv0 32)) (bvsge .cse72 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse71)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse72 (bvadd (bvneg ((_ sign_extend 32) .cse73)) (_ bv18446744071562067968 64))) (bvsle .cse74 (bvadd (_ bv2147483647 32) (bvneg .cse73)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse75 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse76 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse75 (bvadd (bvneg ((_ sign_extend 32) .cse76)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse77 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse78 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse77 (_ bv0 32)) (bvsle .cse77 (_ bv0 32)) (bvsle .cse78 (_ bv0 32)) (bvsge .cse75 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse78)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse76 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse85 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse81 (bvadd .cse7 c_~csum~0 .cse85))) (let ((.cse80 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse79 ((_ sign_extend 32) .cse81))) (and (bvsge .cse79 (bvadd (bvneg ((_ sign_extend 32) .cse80)) (_ bv18446744071562067968 64))) (bvsle .cse81 (bvadd (_ bv2147483647 32) (bvneg .cse80))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse84 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse82 (bvadd .cse84 c_~bsum~0))) (let ((.cse83 ((_ sign_extend 32) .cse82))) (and (bvsle .cse82 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse83 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse82 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse84 .cse85)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse79 (bvadd (_ bv18446744071562067968 64) (bvneg .cse83))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse90 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse91 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse90))) (.cse92 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse89 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse88 (bvadd .cse89 c_~bsum~0))) (let ((.cse87 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse86 ((_ sign_extend 32) .cse88))) (and (bvsge .cse86 .cse87) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse87) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse88 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse89 .cse90)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse91 (bvadd (_ bv18446744071562067968 64) (bvneg .cse86)))))))) (bvsge .cse91 (bvadd (bvneg ((_ sign_extend 32) .cse92)) (_ bv18446744071562067968 64))) (bvsle .cse92 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse98 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse95 (bvadd .cse7 c_~csum~0 .cse98))) (let ((.cse94 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse93 ((_ sign_extend 32) .cse95))) (and (bvsge .cse93 (bvadd (bvneg ((_ sign_extend 32) .cse94)) (_ bv18446744071562067968 64))) (bvsle .cse95 (bvadd (_ bv2147483647 32) (bvneg .cse94))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse97 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse96 (bvadd .cse97 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse96 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse97 .cse98)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse93 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse96)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse102 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse106 (bvadd .cse7 c_~csum~0 .cse102))) (let ((.cse99 ((_ sign_extend 32) .cse106)) (.cse100 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse99 (bvadd (bvneg ((_ sign_extend 32) .cse100)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse101 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse105 (bvadd .cse101 c_~bsum~0))) (let ((.cse103 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse104 ((_ sign_extend 32) .cse105))) (and (bvsle (bvadd c_~csum~0 .cse101 .cse102) (bvadd (bvneg .cse103) (_ bv2147483647 32))) (bvsge .cse103 (_ bv0 32)) (bvsge .cse104 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse105 (_ bv0 32)) (bvsge .cse99 (bvadd (_ bv18446744071562067968 64) (bvneg .cse104)))))))) (bvsle .cse106 (bvadd (_ bv2147483647 32) (bvneg .cse100)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse109 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse108 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse107 ((_ sign_extend 32) .cse109))) (and (bvsge .cse107 (bvadd (bvneg ((_ sign_extend 32) .cse108)) (_ bv18446744071562067968 64))) (bvsle .cse109 (bvadd (_ bv2147483647 32) (bvneg .cse108))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse110 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse111 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse112 ((_ sign_extend 32) .cse110))) (and (bvsle .cse110 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse111 (_ bv0 32)) (bvsge .cse112 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse111 (_ bv0 32)) (bvsle .cse110 (_ bv0 32)) (bvsge .cse107 (bvadd (_ bv18446744071562067968 64) (bvneg .cse112))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse115 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse114 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse113 ((_ sign_extend 32) .cse115))) (and (bvsge .cse113 (bvadd (bvneg ((_ sign_extend 32) .cse114)) (_ bv18446744071562067968 64))) (bvsle .cse115 (bvadd (_ bv2147483647 32) (bvneg .cse114))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse116 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse117 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse116 (_ bv0 32)) (bvsle .cse116 (_ bv0 32)) (bvsle .cse117 (_ bv0 32)) (bvsge .cse113 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse117)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse120 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse121 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse118 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse119 ((_ sign_extend 32) .cse118))) (and (bvsle .cse118 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse119 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse118 (_ bv0 32)) (bvsge .cse120 (bvadd (_ bv18446744071562067968 64) (bvneg .cse119))))))) (bvsge .cse120 (bvadd (bvneg ((_ sign_extend 32) .cse121)) (_ bv18446744071562067968 64))) (bvsle .cse121 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse124 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse125 ((_ sign_extend 32) .cse124)) (.cse126 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse123 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (.cse122 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse122 .cse123) (bvsle .cse124 (bvadd (_ bv2147483647 32) (bvneg .cse122))) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_11 .cse123) (bvsge .cse125 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse122))))))) (bvsge .cse125 (bvadd (bvneg ((_ sign_extend 32) .cse126)) (_ bv18446744071562067968 64))) (bvsle .cse124 (bvadd (_ bv2147483647 32) (bvneg .cse126))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse131 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse129 ((_ sign_extend 32) .cse131)) (.cse130 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse127 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse128 ((_ sign_extend 32) .cse127))) (and (bvsle .cse127 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse128 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse127 (_ bv0 32)) (bvsge .cse129 (bvadd (_ bv18446744071562067968 64) (bvneg .cse128))))))) (bvsge .cse129 (bvadd (bvneg ((_ sign_extend 32) .cse130)) (_ bv18446744071562067968 64))) (bvsle .cse131 (bvadd (_ bv2147483647 32) (bvneg .cse130))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse137 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse132 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse137))) (.cse133 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse132 (bvadd (bvneg ((_ sign_extend 32) .cse133)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse136 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse134 (bvadd .cse136 c_~bsum~0))) (let ((.cse135 ((_ sign_extend 32) .cse134))) (and (bvsle .cse134 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse135 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse134 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse136 .cse137)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse132 (bvadd (_ bv18446744071562067968 64) (bvneg .cse135)))))))) (bvsle .cse133 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse144 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse140 (bvadd .cse7 c_~csum~0 .cse144))) (let ((.cse142 ((_ sign_extend 32) .cse140)) (.cse145 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse143 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse138 (bvadd c_~csum~0 .cse143 .cse144)) (.cse139 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse141 (bvadd .cse143 c_~bsum~0))) (and (bvsle .cse138 (bvadd (bvneg .cse139) (_ bv2147483647 32))) (bvsle .cse140 (bvadd (_ bv2147483647 32) (bvneg .cse141))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse138) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse139)))) (bvsge .cse142 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse141)))))))) (bvsge .cse142 (bvadd (bvneg ((_ sign_extend 32) .cse145)) (_ bv18446744071562067968 64))) (bvsle .cse145 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse150 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse153 (bvadd .cse7 c_~csum~0 .cse150))) (let ((.cse151 ((_ sign_extend 32) .cse153)) (.cse152 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse149 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse146 (bvadd .cse149 c_~bsum~0))) (let ((.cse148 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse147 ((_ sign_extend 32) .cse146))) (and (bvsle .cse146 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse147 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse148 (_ bv0 32)) (bvsle .cse146 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse149 .cse150)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse148)))) (bvsge .cse151 (bvadd (_ bv18446744071562067968 64) (bvneg .cse147)))))))) (bvsge .cse151 (bvadd (bvneg ((_ sign_extend 32) .cse152)) (_ bv18446744071562067968 64))) (bvsle .cse153 (bvadd (_ bv2147483647 32) (bvneg .cse152)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse158 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse154 ((_ sign_extend 32) .cse158)) (.cse155 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse154 (bvadd (bvneg ((_ sign_extend 32) .cse155)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse157 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse156 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse156 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse157 (_ bv0 32)) (bvsle .cse158 (bvadd (_ bv2147483647 32) (bvneg .cse156))) (bvsle .cse157 (_ bv0 32)) (bvsge .cse154 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse156))))))) (bvsle .cse155 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse166 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse159 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse166))) (.cse160 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse159 (bvadd (bvneg ((_ sign_extend 32) .cse160)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse165 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse163 (bvadd .cse165 c_~bsum~0))) (let ((.cse161 (bvadd c_~csum~0 .cse165 .cse166)) (.cse162 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse164 ((_ sign_extend 32) .cse163))) (and (bvsle .cse161 (bvadd (bvneg .cse162) (_ bv2147483647 32))) (bvsle .cse163 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse164 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse163 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse161) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse162)))) (bvsge .cse159 (bvadd (_ bv18446744071562067968 64) (bvneg .cse164)))))))) (bvsle .cse160 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse171 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse167 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse171))) (.cse168 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse167 (bvadd (bvneg ((_ sign_extend 32) .cse168)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse170 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse169 (bvadd .cse170 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse169 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse170 .cse171)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse167 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse169)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse168 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse179 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse174 (bvadd .cse7 c_~csum~0 .cse179))) (let ((.cse173 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse172 ((_ sign_extend 32) .cse174))) (and (bvsge .cse172 (bvadd (bvneg ((_ sign_extend 32) .cse173)) (_ bv18446744071562067968 64))) (bvsle .cse174 (bvadd (_ bv2147483647 32) (bvneg .cse173))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse178 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse175 (bvadd c_~csum~0 .cse178 .cse179)) (.cse176 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse177 (bvadd .cse178 c_~bsum~0))) (and (bvsle .cse175 (bvadd (bvneg .cse176) (_ bv2147483647 32))) (bvsle .cse177 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse175) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse176)))) (bvsge .cse172 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse177)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse182 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse181 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse180 ((_ sign_extend 32) .cse182))) (and (bvsge .cse180 (bvadd (bvneg ((_ sign_extend 32) .cse181)) (_ bv18446744071562067968 64))) (bvsle .cse182 (bvadd (_ bv2147483647 32) (bvneg .cse181))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse183 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse184 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse183 (_ bv0 32)) (bvsle .cse182 (bvadd (_ bv2147483647 32) (bvneg .cse184))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse183 (_ bv0 32)) (bvsge .cse180 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse184)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse187 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse186 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse185 ((_ sign_extend 32) .cse187))) (and (bvsge .cse185 (bvadd (bvneg ((_ sign_extend 32) .cse186)) (_ bv18446744071562067968 64))) (bvsle .cse186 (_ bv0 32)) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse188 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse187 (bvadd (_ bv2147483647 32) (bvneg .cse188))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse185 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse188))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse194 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse192 ((_ sign_extend 32) .cse194)) (.cse193 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse191 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse189 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse190 ((_ sign_extend 32) .cse191))) (and (bvsge .cse189 (_ bv0 32)) (bvsge .cse190 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse189 (_ bv0 32)) (bvsle .cse191 (_ bv0 32)) (bvsge .cse192 (bvadd (_ bv18446744071562067968 64) (bvneg .cse190))))))) (bvsge .cse192 (bvadd (bvneg ((_ sign_extend 32) .cse193)) (_ bv18446744071562067968 64))) (bvsle .cse194 (bvadd (_ bv2147483647 32) (bvneg .cse193))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse196 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse197 ((_ sign_extend 32) .cse196)) (.cse198 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse195 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse195 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse196 (bvadd (_ bv2147483647 32) (bvneg .cse195))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse197 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse195))))))) (bvsge .cse197 (bvadd (bvneg ((_ sign_extend 32) .cse198)) (_ bv18446744071562067968 64))) (bvsle .cse198 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse200 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse203 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse200))) (.cse204 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse199 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse201 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse202 (bvadd .cse199 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse199 .cse200) (bvadd (bvneg .cse201) (_ bv2147483647 32))) (bvsge .cse201 (_ bv0 32)) (bvsle .cse202 (_ bv0 32)) (bvsge .cse203 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse202)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse203 (bvadd (bvneg ((_ sign_extend 32) .cse204)) (_ bv18446744071562067968 64))) (bvsle .cse204 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse206 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse207 (bvadd .cse7 c_~csum~0 .cse206))) (let ((.cse209 ((_ sign_extend 32) .cse207)) (.cse210 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse205 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse208 (bvadd .cse205 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse205 .cse206) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse207 (bvadd (_ bv2147483647 32) (bvneg .cse208))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse209 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse208)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse209 (bvadd (bvneg ((_ sign_extend 32) .cse210)) (_ bv18446744071562067968 64))) (bvsle .cse210 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse216 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse213 (bvadd .cse7 c_~csum~0 .cse216))) (let ((.cse211 ((_ sign_extend 32) .cse213)) (.cse212 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse211 (bvadd (bvneg ((_ sign_extend 32) .cse212)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse215 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse214 (bvadd .cse215 c_~bsum~0))) (and (bvsle .cse213 (bvadd (_ bv2147483647 32) (bvneg .cse214))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse215 .cse216)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse211 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse214)))))))) (bvsle .cse212 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse221 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse217 ((_ sign_extend 32) .cse221)) (.cse218 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse217 (bvadd (bvneg ((_ sign_extend 32) .cse218)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse219 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse220 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse219 (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse219 (_ bv0 32)) (bvsle .cse220 (_ bv0 32)) (bvsge .cse217 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse220)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse221 (bvadd (_ bv2147483647 32) (bvneg .cse218))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse224 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse222 ((_ sign_extend 32) .cse224)) (.cse223 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse222 (bvadd (bvneg ((_ sign_extend 32) .cse223)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse225 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse224 (bvadd (_ bv2147483647 32) (bvneg .cse225))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse222 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse225)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse223 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse232 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse226 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse232))) (.cse227 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse226 (bvadd (bvneg ((_ sign_extend 32) .cse227)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse231 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse228 (bvadd c_~csum~0 .cse231 .cse232)) (.cse229 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse230 (bvadd .cse231 c_~bsum~0))) (and (bvsle .cse228 (bvadd (bvneg .cse229) (_ bv2147483647 32))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse230 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse228) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse229)))) (bvsge .cse226 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse230)))))))) (bvsle .cse227 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse234 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse235 ((_ sign_extend 32) .cse234)) (.cse236 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse233 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse233 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse234 (bvadd (_ bv2147483647 32) (bvneg .cse233))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse235 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse233))))))) (bvsge .cse235 (bvadd (bvneg ((_ sign_extend 32) .cse236)) (_ bv18446744071562067968 64))) (bvsle .cse234 (bvadd (_ bv2147483647 32) (bvneg .cse236))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse243 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse237 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse243))) (.cse238 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse237 (bvadd (bvneg ((_ sign_extend 32) .cse238)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse242 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse239 (bvadd c_~csum~0 .cse242 .cse243)) (.cse240 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse241 (bvadd .cse242 c_~bsum~0))) (and (bvsle .cse239 (bvadd (bvneg .cse240) (_ bv2147483647 32))) (bvsle .cse241 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse239) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse240)))) (bvsge .cse237 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse241)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse238 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse246 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse245 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse244 ((_ sign_extend 32) .cse246))) (and (bvsge .cse244 (bvadd (bvneg ((_ sign_extend 32) .cse245)) (_ bv18446744071562067968 64))) (bvsle .cse246 (bvadd (_ bv2147483647 32) (bvneg .cse245))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse248 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse247 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse247 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse248 (_ bv0 32)) (bvsle .cse246 (bvadd (_ bv2147483647 32) (bvneg .cse247))) (bvsle .cse248 (_ bv0 32)) (bvsge .cse244 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse247))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse253 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse256 (bvadd .cse7 c_~csum~0 .cse253))) (let ((.cse254 ((_ sign_extend 32) .cse256)) (.cse255 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse252 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse251 (bvadd .cse252 c_~bsum~0))) (let ((.cse250 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse249 ((_ sign_extend 32) .cse251))) (and (bvsge .cse249 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse250 (_ bv0 32)) (bvsle .cse251 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse252 .cse253)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse250)))) (bvsge .cse254 (bvadd (_ bv18446744071562067968 64) (bvneg .cse249)))))))) (bvsge .cse254 (bvadd (bvneg ((_ sign_extend 32) .cse255)) (_ bv18446744071562067968 64))) (bvsle .cse256 (bvadd (_ bv2147483647 32) (bvneg .cse255)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse258 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse262 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse258))) (.cse263 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse257 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse260 (bvadd .cse257 c_~bsum~0))) (let ((.cse259 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse261 ((_ sign_extend 32) .cse260))) (and (bvsle (bvadd c_~csum~0 .cse257 .cse258) (bvadd (bvneg .cse259) (_ bv2147483647 32))) (bvsle .cse260 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse259 (_ bv0 32)) (bvsge .cse261 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse260 (_ bv0 32)) (bvsge .cse262 (bvadd (_ bv18446744071562067968 64) (bvneg .cse261)))))))) (bvsge .cse262 (bvadd (bvneg ((_ sign_extend 32) .cse263)) (_ bv18446744071562067968 64))) (bvsle .cse263 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse268 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse266 (bvadd .cse7 c_~csum~0 .cse268))) (let ((.cse265 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse264 ((_ sign_extend 32) .cse266))) (and (bvsge .cse264 (bvadd (bvneg ((_ sign_extend 32) .cse265)) (_ bv18446744071562067968 64))) (bvsle .cse266 (bvadd (_ bv2147483647 32) (bvneg .cse265))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse267 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse269 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse270 (bvadd .cse267 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse267 .cse268) (bvadd (bvneg .cse269) (_ bv2147483647 32))) (bvsle .cse270 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse269 (_ bv0 32)) (bvsle .cse266 (bvadd (_ bv2147483647 32) (bvneg .cse270))) (bvsge .cse264 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse270))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse273 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse271 ((_ sign_extend 32) .cse273)) (.cse272 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse271 (bvadd (bvneg ((_ sign_extend 32) .cse272)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse274 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse273 (bvadd (_ bv2147483647 32) (bvneg .cse274))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse271 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse274)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse273 (bvadd (_ bv2147483647 32) (bvneg .cse272))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse276 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse277 (bvadd .cse7 c_~csum~0 .cse276))) (let ((.cse279 ((_ sign_extend 32) .cse277)) (.cse280 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse275 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse278 (bvadd .cse275 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse275 .cse276) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse277 (bvadd (_ bv2147483647 32) (bvneg .cse278))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse279 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse278)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse279 (bvadd (bvneg ((_ sign_extend 32) .cse280)) (_ bv18446744071562067968 64))) (bvsle .cse277 (bvadd (_ bv2147483647 32) (bvneg .cse280)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse287 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse281 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse287))) (.cse282 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse281 (bvadd (bvneg ((_ sign_extend 32) .cse282)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse286 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse283 (bvadd c_~csum~0 .cse286 .cse287)) (.cse284 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse285 (bvadd .cse286 c_~bsum~0))) (and (bvsle .cse283 (bvadd (bvneg .cse284) (_ bv2147483647 32))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse285 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse283) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse284)))) (bvsge .cse281 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse285)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse282 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse294 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse292 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse294))) (.cse295 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse293 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse290 (bvadd .cse293 c_~bsum~0))) (let ((.cse288 (bvadd c_~csum~0 .cse293 .cse294)) (.cse289 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse291 ((_ sign_extend 32) .cse290))) (and (bvsle .cse288 (bvadd (bvneg .cse289) (_ bv2147483647 32))) (bvsle .cse290 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse291 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse290 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse288) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse289)))) (bvsge .cse292 (bvadd (_ bv18446744071562067968 64) (bvneg .cse291)))))))) (bvsge .cse292 (bvadd (bvneg ((_ sign_extend 32) .cse295)) (_ bv18446744071562067968 64))) (bvsle .cse295 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse299 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse296 ((_ sign_extend 32) .cse299)) (.cse297 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse296 (bvadd (bvneg ((_ sign_extend 32) .cse297)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse298 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse298 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse299 (bvadd (_ bv2147483647 32) (bvneg .cse298))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse296 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse298))))))) (bvsle .cse297 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse306 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse303 (bvadd .cse7 c_~csum~0 .cse306))) (let ((.cse304 ((_ sign_extend 32) .cse303)) (.cse307 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse305 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse300 (bvadd c_~csum~0 .cse305 .cse306)) (.cse301 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse302 (bvadd .cse305 c_~bsum~0))) (and (bvsle .cse300 (bvadd (bvneg .cse301) (_ bv2147483647 32))) (bvsle .cse302 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse303 (bvadd (_ bv2147483647 32) (bvneg .cse302))) (bvsge ((_ sign_extend 32) .cse300) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse301)))) (bvsge .cse304 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse302)))))))) (bvsge .cse304 (bvadd (bvneg ((_ sign_extend 32) .cse307)) (_ bv18446744071562067968 64))) (bvsle .cse307 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse310 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse309 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse308 ((_ sign_extend 32) .cse310))) (and (bvsge .cse308 (bvadd (bvneg ((_ sign_extend 32) .cse309)) (_ bv18446744071562067968 64))) (bvsle .cse310 (bvadd (_ bv2147483647 32) (bvneg .cse309))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse311 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_11 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse311 (_ bv0 32)) (bvsge .cse308 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse311))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse312 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse313 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse312 (bvadd (bvneg ((_ sign_extend 32) .cse313)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse314 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse315 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse316 ((_ sign_extend 32) .cse314))) (and (bvsle .cse314 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse315 (_ bv0 32)) (bvsge .cse316 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse315 (_ bv0 32)) (bvsle .cse314 (_ bv0 32)) (bvsge .cse312 (bvadd (_ bv18446744071562067968 64) (bvneg .cse316))))))) (bvsle .cse313 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse318 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse324 (bvadd .cse7 c_~csum~0 .cse318))) (let ((.cse322 ((_ sign_extend 32) .cse324)) (.cse323 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse317 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse320 (bvadd .cse317 c_~bsum~0))) (let ((.cse319 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse321 ((_ sign_extend 32) .cse320))) (and (bvsle (bvadd c_~csum~0 .cse317 .cse318) (bvadd (bvneg .cse319) (_ bv2147483647 32))) (bvsle .cse320 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse319 (_ bv0 32)) (bvsge .cse321 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse320 (_ bv0 32)) (bvsge .cse322 (bvadd (_ bv18446744071562067968 64) (bvneg .cse321)))))))) (bvsge .cse322 (bvadd (bvneg ((_ sign_extend 32) .cse323)) (_ bv18446744071562067968 64))) (bvsle .cse324 (bvadd (_ bv2147483647 32) (bvneg .cse323)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse326 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse328 (bvadd .cse7 c_~csum~0 .cse326))) (let ((.cse329 ((_ sign_extend 32) .cse328)) (.cse330 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse325 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse327 (bvadd .cse325 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse325 .cse326) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse327 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse328 (bvadd (_ bv2147483647 32) (bvneg .cse327))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse329 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse327)))))))) (bvsge .cse329 (bvadd (bvneg ((_ sign_extend 32) .cse330)) (_ bv18446744071562067968 64))) (bvsle .cse330 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse338 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse339 (bvadd .cse7 c_~csum~0 .cse338))) (let ((.cse331 ((_ sign_extend 32) .cse339)) (.cse332 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse331 (bvadd (bvneg ((_ sign_extend 32) .cse332)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse337 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse336 (bvadd .cse337 c_~bsum~0))) (let ((.cse333 (bvadd c_~csum~0 .cse337 .cse338)) (.cse334 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse335 ((_ sign_extend 32) .cse336))) (and (bvsle .cse333 (bvadd (bvneg .cse334) (_ bv2147483647 32))) (bvsge .cse335 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse336 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse333) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse334)))) (bvsge .cse331 (bvadd (_ bv18446744071562067968 64) (bvneg .cse335)))))))) (bvsle .cse339 (bvadd (_ bv2147483647 32) (bvneg .cse332)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse343 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse346 (bvadd .cse7 c_~csum~0 .cse343))) (let ((.cse340 ((_ sign_extend 32) .cse346)) (.cse341 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse340 (bvadd (bvneg ((_ sign_extend 32) .cse341)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse342 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse344 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse345 (bvadd .cse342 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse342 .cse343) (bvadd (bvneg .cse344) (_ bv2147483647 32))) (bvsle .cse345 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse344 (_ bv0 32)) (bvsle .cse346 (bvadd (_ bv2147483647 32) (bvneg .cse345))) (bvsge .cse340 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse345)))))))) (bvsle .cse341 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse353 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse349 (bvadd .cse7 c_~csum~0 .cse353))) (let ((.cse347 ((_ sign_extend 32) .cse349)) (.cse348 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse347 (bvadd (bvneg ((_ sign_extend 32) .cse348)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse352 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse351 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse350 (bvadd .cse352 c_~bsum~0))) (and (bvsle .cse349 (bvadd (_ bv2147483647 32) (bvneg .cse350))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse351 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse352 .cse353)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse351)))) (bvsge .cse347 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse350)))))))) (bvsle .cse349 (bvadd (_ bv2147483647 32) (bvneg .cse348)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse360 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse357 (bvadd .cse7 c_~csum~0 .cse360))) (let ((.cse354 ((_ sign_extend 32) .cse357)) (.cse355 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse354 (bvadd (bvneg ((_ sign_extend 32) .cse355)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse359 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse358 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse356 (bvadd .cse359 c_~bsum~0))) (and (bvsle .cse356 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse357 (bvadd (_ bv2147483647 32) (bvneg .cse356))) (bvsle .cse358 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse359 .cse360)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse358)))) (bvsge .cse354 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse356)))))))) (bvsle .cse355 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse367 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse363 (bvadd .cse7 c_~csum~0 .cse367))) (let ((.cse365 ((_ sign_extend 32) .cse363)) (.cse368 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse366 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse361 (bvadd c_~csum~0 .cse366 .cse367)) (.cse362 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse364 (bvadd .cse366 c_~bsum~0))) (and (bvsle .cse361 (bvadd (bvneg .cse362) (_ bv2147483647 32))) (bvsle .cse363 (bvadd (_ bv2147483647 32) (bvneg .cse364))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse361) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse362)))) (bvsge .cse365 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse364)))))))) (bvsge .cse365 (bvadd (bvneg ((_ sign_extend 32) .cse368)) (_ bv18446744071562067968 64))) (bvsle .cse363 (bvadd (_ bv2147483647 32) (bvneg .cse368)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse372 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse369 ((_ sign_extend 32) .cse372)) (.cse370 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse369 (bvadd (bvneg ((_ sign_extend 32) .cse370)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse371 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse373 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse371 (_ bv0 32)) (bvsle .cse372 (bvadd (_ bv2147483647 32) (bvneg .cse373))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse371 (_ bv0 32)) (bvsge .cse369 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse373))))))) (bvsle .cse372 (bvadd (_ bv2147483647 32) (bvneg .cse370))))))))) (= c_~csum~0 (bvadd c_~asum~0 c_~bsum~0))) is different from false