./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i --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/libvsync/bounded_mpmc_check_full.i -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 f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --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 04:08:24,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 04:08:24,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 04:08:24,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 04:08:24,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 04:08:25,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 04:08:25,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 04:08:25,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 04:08:25,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 04:08:25,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 04:08:25,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 04:08:25,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 04:08:25,022 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 04:08:25,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 04:08:25,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 04:08:25,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 04:08:25,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 04:08:25,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 04:08:25,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 04:08:25,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 04:08:25,023 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 04:08:25,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 04:08:25,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 04:08:25,024 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 04:08:25,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 04:08:25,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 04:08:25,024 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 04:08:25,024 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 04:08:25,024 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 -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe 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 04:08:25,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 04:08:25,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 04:08:25,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 04:08:25,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 04:08:25,240 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 04:08:25,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-04-25 04:08:26,491 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/160b64691/e4df22637f0748cf8229ba516e63b2ee/FLAGf548f28d0 [2025-04-25 04:08:26,860 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 04:08:26,860 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-04-25 04:08:26,901 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/160b64691/e4df22637f0748cf8229ba516e63b2ee/FLAGf548f28d0 [2025-04-25 04:08:27,492 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/160b64691/e4df22637f0748cf8229ba516e63b2ee [2025-04-25 04:08:27,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 04:08:27,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 04:08:27,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 04:08:27,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 04:08:27,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 04:08:27,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 04:08:27" (1/1) ... [2025-04-25 04:08:27,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4676d1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:27, skipping insertion in model container [2025-04-25 04:08:27,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 04:08:27" (1/1) ... [2025-04-25 04:08:27,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 04:08:30,033 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/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-04-25 04:08:30,036 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/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-04-25 04:08:30,084 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/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-04-25 04:08:30,084 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/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-04-25 04:08:30,085 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/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-04-25 04:08:30,085 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/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-04-25 04:08:30,085 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/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-04-25 04:08:30,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 04:08:30,094 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 04:08:30,208 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-04-25 04:08:30,209 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-04-25 04:08:30,210 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-04-25 04:08:30,212 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-04-25 04:08:30,213 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-04-25 04:08:30,213 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-04-25 04:08:30,214 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-04-25 04:08:30,214 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-04-25 04:08:30,214 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-04-25 04:08:30,214 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-04-25 04:08:30,215 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-04-25 04:08:30,215 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-04-25 04:08:30,215 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-04-25 04:08:30,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-04-25 04:08:30,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-04-25 04:08:30,217 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-04-25 04:08:30,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-04-25 04:08:30,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-04-25 04:08:30,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-04-25 04:08:30,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-04-25 04:08:30,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-04-25 04:08:30,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-04-25 04:08:30,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-04-25 04:08:30,221 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-04-25 04:08:30,221 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-04-25 04:08:30,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-04-25 04:08:30,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-04-25 04:08:30,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-04-25 04:08:30,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-04-25 04:08:30,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-04-25 04:08:30,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-04-25 04:08:30,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-04-25 04:08:30,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-04-25 04:08:30,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-04-25 04:08:30,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-04-25 04:08:30,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-04-25 04:08:30,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-04-25 04:08:30,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-04-25 04:08:30,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-04-25 04:08:30,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-04-25 04:08:30,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-04-25 04:08:30,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-04-25 04:08:30,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-04-25 04:08:30,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-04-25 04:08:30,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-04-25 04:08:30,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-04-25 04:08:30,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-04-25 04:08:30,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-04-25 04:08:30,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-04-25 04:08:30,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-04-25 04:08:30,237 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-04-25 04:08:30,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-04-25 04:08:30,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-04-25 04:08:30,238 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-04-25 04:08:30,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-04-25 04:08:30,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-04-25 04:08:30,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-04-25 04:08:30,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-04-25 04:08:30,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-04-25 04:08:30,240 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-04-25 04:08:30,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-04-25 04:08:30,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-04-25 04:08:30,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-04-25 04:08:30,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-04-25 04:08:30,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-04-25 04:08:30,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-04-25 04:08:30,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-04-25 04:08:30,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-04-25 04:08:30,243 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-04-25 04:08:30,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-04-25 04:08:30,244 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-04-25 04:08:30,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-04-25 04:08:30,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-04-25 04:08:30,245 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-04-25 04:08:30,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-04-25 04:08:30,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-04-25 04:08:30,246 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-04-25 04:08:30,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-04-25 04:08:30,247 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-04-25 04:08:30,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-04-25 04:08:30,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-04-25 04:08:30,248 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-04-25 04:08:30,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-04-25 04:08:30,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-04-25 04:08:30,249 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-04-25 04:08:30,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-04-25 04:08:30,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-04-25 04:08:30,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-04-25 04:08:30,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-04-25 04:08:30,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-04-25 04:08:30,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-04-25 04:08:30,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-04-25 04:08:30,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-04-25 04:08:30,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-04-25 04:08:30,252 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-04-25 04:08:30,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-04-25 04:08:30,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-04-25 04:08:30,253 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-04-25 04:08:30,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-04-25 04:08:30,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-04-25 04:08:30,302 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/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-04-25 04:08:30,303 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/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-04-25 04:08:30,310 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/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-04-25 04:08:30,312 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/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-04-25 04:08:30,312 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/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-04-25 04:08:30,313 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/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-04-25 04:08:30,313 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/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-04-25 04:08:30,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 04:08:30,491 INFO L204 MainTranslator]: Completed translation [2025-04-25 04:08:30,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30 WrapperNode [2025-04-25 04:08:30,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 04:08:30,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 04:08:30,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 04:08:30,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 04:08:30,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,625 INFO L138 Inliner]: procedures = 914, calls = 950, calls flagged for inlining = 815, calls inlined = 57, statements flattened = 628 [2025-04-25 04:08:30,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 04:08:30,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 04:08:30,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 04:08:30,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 04:08:30,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 04:08:30,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 04:08:30,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 04:08:30,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 04:08:30,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (1/1) ... [2025-04-25 04:08:30,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 04:08:30,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:08:30,725 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 04:08:30,727 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 04:08:30,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 04:08:30,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-04-25 04:08:30,746 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-25 04:08:30,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 04:08:30,747 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 04:08:30,879 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 04:08:30,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 04:08:31,665 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 04:08:31,665 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 04:08:32,005 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 04:08:32,006 INFO L312 CfgBuilder]: Removed 20 assume(true) statements. [2025-04-25 04:08:32,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 04:08:32 BoogieIcfgContainer [2025-04-25 04:08:32,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 04:08:32,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 04:08:32,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 04:08:32,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 04:08:32,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 04:08:27" (1/3) ... [2025-04-25 04:08:32,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24729147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 04:08:32, skipping insertion in model container [2025-04-25 04:08:32,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:08:30" (2/3) ... [2025-04-25 04:08:32,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24729147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 04:08:32, skipping insertion in model container [2025-04-25 04:08:32,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 04:08:32" (3/3) ... [2025-04-25 04:08:32,012 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-04-25 04:08:32,025 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 04:08:32,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 125 locations, 178 edges, 1 initial locations, 23 loop locations, and 7 error locations. [2025-04-25 04:08:32,028 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 04:08:32,094 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-25 04:08:32,133 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 04:08:32,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 04:08:32,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:08:32,137 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 04:08:32,139 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 04:08:32,239 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 04:08:32,249 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 04:08:32,254 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;@384f6270, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 04:08:32,254 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-25 04:08:34,433 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:34,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:34,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1411605412, now seen corresponding path program 1 times [2025-04-25 04:08:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:34,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897016874] [2025-04-25 04:08:34,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:34,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:34,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-25 04:08:34,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-25 04:08:34,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 04:08:34,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 04:08:34,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-25 04:08:34,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-25 04:08:34,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:34,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 04:08:34,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 04:08:34,807 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 04:08:34,808 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-25 04:08:34,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-25 04:08:34,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-25 04:08:34,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-25 04:08:34,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-25 04:08:34,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-25 04:08:34,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-25 04:08:34,809 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-25 04:08:34,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 04:08:34,817 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-25 04:08:34,818 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 04:08:34,819 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-25 04:08:34,882 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 04:08:34,892 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 04:08:34,919 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 04:08:34,920 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 04:08:34,921 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;@384f6270, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 04:08:34,921 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-25 04:08:41,451 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:41,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1986655527, now seen corresponding path program 1 times [2025-04-25 04:08:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:41,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294701647] [2025-04-25 04:08:41,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:41,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:41,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-25 04:08:41,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 04:08:41,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:41,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:08:41,596 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 04:08:41,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:08:41,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294701647] [2025-04-25 04:08:41,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294701647] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:08:41,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:08:41,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 04:08:41,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325995409] [2025-04-25 04:08:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:08:41,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 04:08:41,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:08:41,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 04:08:41,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 04:08:41,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:41,621 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:08:41,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 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 04:08:41,623 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:44,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:44,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 04:08:44,067 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:44,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:44,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1722852705, now seen corresponding path program 1 times [2025-04-25 04:08:44,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:44,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723765047] [2025-04-25 04:08:44,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:44,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:44,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-25 04:08:44,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-25 04:08:44,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:44,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:08:44,281 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 04:08:44,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:08:44,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723765047] [2025-04-25 04:08:44,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723765047] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:08:44,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:08:44,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 04:08:44,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570890185] [2025-04-25 04:08:44,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:08:44,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 04:08:44,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:08:44,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 04:08:44,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 04:08:44,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:44,284 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:08:44,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 04:08:44,285 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:44,285 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:44,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:44,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:44,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 04:08:44,399 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:44,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1606987198, now seen corresponding path program 1 times [2025-04-25 04:08:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:44,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766767272] [2025-04-25 04:08:44,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:44,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-25 04:08:44,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-25 04:08:44,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:44,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:08:44,668 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 04:08:44,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:08:44,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766767272] [2025-04-25 04:08:44,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766767272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:08:44,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:08:44,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 04:08:44,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105858307] [2025-04-25 04:08:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:08:44,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 04:08:44,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:08:44,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 04:08:44,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-25 04:08:44,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:44,669 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:08:44,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 04:08:44,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:44,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:44,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:49,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:49,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:49,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:49,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 04:08:49,710 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:49,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1553125445, now seen corresponding path program 1 times [2025-04-25 04:08:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:49,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795480219] [2025-04-25 04:08:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:49,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-04-25 04:08:49,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-04-25 04:08:49,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:49,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:08:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-25 04:08:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:08:50,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795480219] [2025-04-25 04:08:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795480219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:08:50,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:08:50,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 04:08:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644946660] [2025-04-25 04:08:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:08:50,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 04:08:50,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:08:50,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 04:08:50,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 04:08:50,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:50,102 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:08:50,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 04:08:50,102 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:50,102 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:50,102 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:50,102 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:53,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:53,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:53,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:53,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:53,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 04:08:53,553 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:53,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1035342151, now seen corresponding path program 1 times [2025-04-25 04:08:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:53,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124094478] [2025-04-25 04:08:53,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:53,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-04-25 04:08:53,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-04-25 04:08:53,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:53,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:08:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-25 04:08:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:08:53,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124094478] [2025-04-25 04:08:53,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124094478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:08:53,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:08:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 04:08:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201845827] [2025-04-25 04:08:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:08:53,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 04:08:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:08:53,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 04:08:53,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 04:08:53,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:53,933 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:08:53,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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 04:08:53,933 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:53,933 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:53,933 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:53,933 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:53,933 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:54,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:54,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:54,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-25 04:08:54,152 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:54,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2046002807, now seen corresponding path program 1 times [2025-04-25 04:08:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:54,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886801832] [2025-04-25 04:08:54,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:54,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:54,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-04-25 04:08:54,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-04-25 04:08:54,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:54,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:08:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-25 04:08:54,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:08:54,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886801832] [2025-04-25 04:08:54,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886801832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:08:54,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:08:54,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 04:08:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003508175] [2025-04-25 04:08:54,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:08:54,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 04:08:54,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:08:54,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 04:08:54,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 04:08:54,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:54,558 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:08:54,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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 04:08:54,558 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:54,558 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,558 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:54,558 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,558 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,558 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:54,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:54,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:54,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:54,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-25 04:08:54,813 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:54,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash -505767851, now seen corresponding path program 2 times [2025-04-25 04:08:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:54,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773909111] [2025-04-25 04:08:54,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 04:08:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:54,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 295 statements into 2 equivalence classes. [2025-04-25 04:08:54,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 141 of 295 statements. [2025-04-25 04:08:54,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 04:08:54,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:08:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-04-25 04:08:55,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:08:55,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773909111] [2025-04-25 04:08:55,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773909111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:08:55,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:08:55,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 04:08:55,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247812858] [2025-04-25 04:08:55,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:08:55,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 04:08:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:08:55,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 04:08:55,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 04:08:55,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:55,057 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:08:55,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 04:08:55,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:55,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:55,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:55,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:55,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:55,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:55,057 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:55,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:55,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:55,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:55,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:55,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:55,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:55,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:55,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-25 04:08:55,194 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:55,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1720943832, now seen corresponding path program 1 times [2025-04-25 04:08:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:55,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385165213] [2025-04-25 04:08:55,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:55,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-04-25 04:08:55,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-04-25 04:08:55,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:55,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:08:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-25 04:08:56,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:08:56,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385165213] [2025-04-25 04:08:56,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385165213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:08:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:08:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-25 04:08:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428840022] [2025-04-25 04:08:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:08:56,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 04:08:56,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:08:56,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 04:08:56,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-25 04:08:56,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:56,676 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:08:56,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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 04:08:56,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:56,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:56,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:56,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:56,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:56,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:56,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:56,676 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:57,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:57,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:57,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:57,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:57,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:57,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:57,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:57,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:08:57,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-25 04:08:57,091 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:57,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1740243234, now seen corresponding path program 1 times [2025-04-25 04:08:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:57,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463604321] [2025-04-25 04:08:57,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:57,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-04-25 04:08:57,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-04-25 04:08:57,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:57,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:08:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-25 04:08:58,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:08:58,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463604321] [2025-04-25 04:08:58,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463604321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:08:58,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:08:58,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-25 04:08:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475596042] [2025-04-25 04:08:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:08:58,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 04:08:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:08:58,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 04:08:58,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-25 04:08:58,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:58,002 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:08:58,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 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 04:08:58,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:58,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:58,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,003 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,003 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,003 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,003 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:08:58,003 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:58,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:08:58,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:08:58,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:08:58,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:08:58,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:08:58,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-25 04:08:58,322 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:08:58,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:08:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash -995174848, now seen corresponding path program 1 times [2025-04-25 04:08:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:08:58,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515172102] [2025-04-25 04:08:58,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:08:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:08:58,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-04-25 04:08:59,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-04-25 04:08:59,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:08:59,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:09:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 04:09:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:09:21,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515172102] [2025-04-25 04:09:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515172102] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 04:09:21,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652853264] [2025-04-25 04:09:21,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 04:09:21,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 04:09:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:09:21,843 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 04:09:21,844 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 04:09:22,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-04-25 04:09:22,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-04-25 04:09:22,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 04:09:22,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:09:22,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 2171 conjuncts, 845 conjuncts are in the unsatisfiable core [2025-04-25 04:09:22,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 04:09:22,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-25 04:09:22,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-04-25 04:09:22,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-25 04:09:22,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-25 04:09:22,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2025-04-25 04:09:22,907 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-25 04:09:23,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:23,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-25 04:09:23,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:23,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:23,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:23,106 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-04-25 04:09:23,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-25 04:09:23,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-04-25 04:09:23,394 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-25 04:09:23,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-25 04:09:23,475 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-25 04:09:23,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-25 04:09:23,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:23,533 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-25 04:09:23,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:23,537 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-25 04:09:23,556 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-25 04:09:23,559 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-25 04:09:23,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:23,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-25 04:09:23,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:23,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-25 04:09:24,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:24,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:24,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:24,670 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2025-04-25 04:09:24,678 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-25 04:09:24,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-25 04:09:24,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-25 04:09:24,896 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 04:09:24,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 47 [2025-04-25 04:09:24,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-25 04:09:25,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:25,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-25 04:09:25,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 04:09:25,272 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-25 04:09:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 04:09:25,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 04:09:26,396 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~exp~2#1| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~curr~0#1|)) (.cse1 (+ |c_~#g_queue~0.offset| 8)) (.cse2 (+ |c_~#g_queue~0.offset| 4)) (.cse4 (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse5 (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (and (or (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_ArrVal_1539 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~next~0#1|) (let ((.cse0 (select (let ((.cse3 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse5) v_ArrVal_1539))) (store .cse3 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse3 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse4 |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |c_~#g_queue~0.base|))) (< (select .cse0 .cse1) (select .cse0 .cse2))))) .cse6) (or (not .cse6) (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int) (v_ArrVal_1539 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~next~0#1|) (let ((.cse7 (select (let ((.cse8 (store (store |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.offset| v_DerPreprocessor_2)) (select (select (store |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.offset| v_DerPreprocessor_1)) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse5) v_ArrVal_1539))) (store .cse8 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse8 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse4 |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |c_~#g_queue~0.base|))) (< (select .cse7 .cse1) (select .cse7 .cse2)))))))) is different from false [2025-04-25 04:09:26,417 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1539 (Array Int Int))) (or (let ((.cse0 (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (store (store |c_#memory_int| .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_2)) .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4) |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |c_~#g_queue~0.base|))) (< (select .cse0 (+ |c_~#g_queue~0.offset| 8)) (select .cse0 (+ |c_~#g_queue~0.offset| 4)))) (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1)))) is different from false [2025-04-25 04:09:26,448 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1539 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| (+ |c_writerThread2of2ForFork0_vatomic32_read_#t~mem436#1| 1)) (let ((.cse0 (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (store (store |c_#memory_int| .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_2)) .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4) |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |c_~#g_queue~0.base|))) (< (select .cse0 (+ |c_~#g_queue~0.offset| 8)) (select .cse0 (+ |c_~#g_queue~0.offset| 4)))))) is different from false [2025-04-25 04:09:26,459 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1539 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| (+ (select (select |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_read_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_read_~a#1.offset|) 1)) (let ((.cse0 (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (store (store |c_#memory_int| .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_2)) .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4) |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |c_~#g_queue~0.base|))) (< (select .cse0 (+ |c_~#g_queue~0.offset| 8)) (select .cse0 (+ |c_~#g_queue~0.offset| 4)))))) is different from false [2025-04-25 04:09:26,467 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_2 Int) (v_ArrVal_1539 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#g_queue~0.base|))) (< (select (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 16)) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse0 |c_~#g_queue~0.offset|) 1)))) is different from false [2025-04-25 04:09:26,525 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 Int) (v_ArrVal_1534 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1539 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_write_~a#1.offset| v_ArrVal_1534)))) (let ((.cse1 (select .cse0 |c_~#g_queue~0.base|))) (< (select (select (store (store .cse0 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_write_~a#1.offset| v_ArrVal_1531)) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 16)) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse1 |c_~#g_queue~0.offset|) 1))))) is different from false [2025-04-25 04:09:28,846 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1524))) (let ((.cse7 (select .cse1 |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse7 |c_~#g_queue~0.offset|))) (or (< v_ArrVal_1528 (+ .cse0 1)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1523))) (let ((.cse5 (select .cse4 |c_~#g_queue~0.base|)) (.cse6 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse2 (select .cse5 .cse6))) (let ((.cse3 (select (store (store .cse1 |c_~#g_queue~0.base| (store .cse7 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse2 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 .cse2 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse3 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store .cse4 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse2 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse6) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse3 |c_~#g_queue~0.offset|) 1)))))) (= (mod (select .cse7 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ .cse0 (* 4294967295 (select .cse7 (+ |c_~#g_queue~0.offset| 12)))) 4294967296))))))) is different from false [2025-04-25 04:09:29,052 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_write_~a#1.offset| |c_writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_1524))) (let ((.cse0 (select .cse2 |c_~#g_queue~0.base|))) (let ((.cse1 (select .cse0 |c_~#g_queue~0.offset|))) (or (= (mod (select .cse0 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ (* 4294967295 (select .cse0 (+ |c_~#g_queue~0.offset| 12))) .cse1) 4294967296)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_write_~a#1.offset| v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.base|)) (.cse7 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse3 (select .cse6 .cse7))) (let ((.cse4 (select (store (store .cse2 |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse3 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse2 .cse3 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse4 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store .cse5 |c_~#g_queue~0.base| (store .cse6 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse3 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse7) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse4 |c_~#g_queue~0.offset|) 1)))))) (< v_ArrVal_1528 (+ .cse1 1))))))) is different from false [2025-04-25 04:09:31,686 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|)) (.cse8 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse11 (select .cse10 .cse8))) (let ((.cse9 (store |c_#memory_int| .cse11 v_ArrVal_1517)) (.cse5 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse1 (select (store (store .cse9 |c_~#g_queue~0.base| (let ((.cse12 (select |c_#memory_int| |c_~#g_queue~0.base|))) (let ((.cse13 (+ (select .cse12 |c_~#g_queue~0.offset|) 1))) (store (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| .cse13)) .cse11 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse5 .cse13)))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse1 |c_~#g_queue~0.offset|))) (or (< v_ArrVal_1528 (+ .cse0 1)) (= (mod (select .cse1 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ .cse0 (* 4294967295 (select .cse1 (+ |c_~#g_queue~0.offset| 12)))) 4294967296)) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_1518))) (let ((.cse7 (select (store (store .cse6 |c_~#g_queue~0.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse10 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse11 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse5 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse2 (store .cse9 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse3 (select .cse7 .cse8))) (let ((.cse4 (select (store (store .cse2 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse3 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse2 .cse3 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse6 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse7 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse3 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse8) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse4 |c_~#g_queue~0.offset|) 1))))))))))))) is different from false [2025-04-25 04:09:33,661 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse15 (select .cse14 |c_~#g_queue~0.base|)) (.cse12 (+ |c_~#g_queue~0.offset| 16)) (.cse17 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse5 (select .cse17 |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse12))) (let ((.cse13 (store |c_#memory_int| .cse16 v_ArrVal_1517)) (.cse9 (+ |c_~#g_queue~0.offset| 4)) (.cse4 (select .cse5 |c_~#g_queue~0.offset|))) (let ((.cse0 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse18 (+ .cse4 1))) (store (select (store (store .cse17 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| .cse18)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse18))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse2 (select .cse0 |c_~#g_queue~0.offset|)) (.cse3 (+ |c_~#g_queue~0.offset| 12)) (.cse1 (+ |c_~#g_queue~0.offset| 20))) (or (= (mod (select .cse0 .cse1) 4294967296) (mod (+ .cse2 (* (select .cse0 .cse3) 4294967295)) 4294967296)) (< v_ArrVal_1528 (+ .cse2 1)) (not (= (mod (+ .cse4 (* 4294967295 (select .cse5 .cse3))) 4294967296) (mod (select .cse5 .cse1) 4294967296))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse16 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store .cse14 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))))))))) is different from false [2025-04-25 04:09:34,090 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_write_~a#1.offset| v_ArrVal_1510)))) (let ((.cse20 (store |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_write_~a#1.offset| v_ArrVal_1509))) (.cse14 (store .cse17 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse15 (select .cse14 |c_~#g_queue~0.base|)) (.cse12 (+ |c_~#g_queue~0.offset| 16)) (.cse18 (store .cse20 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse1 (select .cse18 |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse12))) (let ((.cse13 (store .cse20 .cse16 v_ArrVal_1517)) (.cse9 (+ |c_~#g_queue~0.offset| 4)) (.cse3 (select .cse1 |c_~#g_queue~0.offset|))) (let ((.cse5 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse19 (+ .cse3 1))) (store (select (store (store .cse18 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| .cse19)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse19))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse4 (+ |c_~#g_queue~0.offset| 12)) (.cse0 (select .cse5 |c_~#g_queue~0.offset|)) (.cse2 (+ |c_~#g_queue~0.offset| 20))) (or (< v_ArrVal_1528 (+ 1 .cse0)) (not (= (mod (select .cse1 .cse2) 4294967296) (mod (+ .cse3 (* 4294967295 (select .cse1 .cse4))) 4294967296))) (= (mod (+ (* (select .cse5 .cse4) 4294967295) .cse0) 4294967296) (mod (select .cse5 .cse2) 4294967296)) (let ((.cse10 (store .cse17 .cse16 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store .cse14 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse8 |c_~#g_queue~0.offset|) 1))))))))))))))) is different from false [2025-04-25 04:09:34,181 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse22 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse23 (select (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (let ((.cse17 (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse23 v_ArrVal_1505))) (store .cse24 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse24 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse22 v_ArrVal_1510))))) (let ((.cse20 (let ((.cse21 (store |c_#memory_int| .cse23 v_ArrVal_1506))) (store .cse21 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse21 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse22 v_ArrVal_1509)))) (.cse14 (store .cse17 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse15 (select .cse14 |c_~#g_queue~0.base|)) (.cse12 (+ |c_~#g_queue~0.offset| 16)) (.cse18 (store .cse20 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse5 (select .cse18 |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse12))) (let ((.cse13 (store .cse20 .cse16 v_ArrVal_1517)) (.cse9 (+ |c_~#g_queue~0.offset| 4)) (.cse4 (select .cse5 |c_~#g_queue~0.offset|))) (let ((.cse1 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse19 (+ .cse4 1))) (store (select (store (store .cse18 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| .cse19)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse19))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse1 |c_~#g_queue~0.offset|)) (.cse2 (+ |c_~#g_queue~0.offset| 12)) (.cse3 (+ |c_~#g_queue~0.offset| 20))) (or (= (mod (+ .cse0 (* 4294967295 (select .cse1 .cse2))) 4294967296) (mod (select .cse1 .cse3) 4294967296)) (< v_ArrVal_1528 (+ .cse0 1)) (not (= (mod (+ .cse4 (* (select .cse5 .cse2) 4294967295)) 4294967296) (mod (select .cse5 .cse3) 4294967296))) (let ((.cse10 (store .cse17 .cse16 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store .cse14 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))))))))))) is different from false [2025-04-25 04:09:34,858 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse25 (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base|))) (let ((.cse0 (= |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~exp~2#1| (select .cse25 |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.offset|))) (.cse18 (+ |c_~#g_queue~0.offset| 12)) (.cse19 (+ |c_~#g_queue~0.offset| 20)) (.cse8 (+ |c_~#g_queue~0.offset| 8)) (.cse4 (+ |c_~#g_queue~0.offset| 4)) (.cse7 (+ |c_~#g_queue~0.offset| 16)) (.cse24 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse29 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.offset| v_DerPreprocessor_5)))) (let ((.cse26 (select (select .cse28 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse29))) (let ((.cse14 (let ((.cse27 (store .cse28 .cse26 v_ArrVal_1505))) (store .cse27 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse27 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510))))) (let ((.cse22 (let ((.cse23 (store (store |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base| (store .cse25 |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.offset| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~v#1|)) .cse26 v_ArrVal_1506))) (store .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509)))) (.cse11 (store .cse14 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse12 (select .cse11 |c_~#g_queue~0.base|)) (.cse20 (store .cse22 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse17 (select .cse20 |c_~#g_queue~0.base|)) (.cse13 (select .cse12 .cse7))) (let ((.cse10 (store .cse22 .cse13 v_ArrVal_1517)) (.cse16 (select .cse17 |c_~#g_queue~0.offset|))) (let ((.cse9 (select (store (store .cse10 |c_~#g_queue~0.base| (let ((.cse21 (+ .cse16 1))) (store (select (store (store .cse20 |c_~#g_queue~0.base| (store .cse17 |c_~#g_queue~0.offset| .cse21)) .cse13 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse4 .cse21))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse15 (select .cse9 |c_~#g_queue~0.offset|))) (or (let ((.cse5 (store .cse14 .cse13 v_ArrVal_1518))) (let ((.cse6 (select (store (store .cse5 |c_~#g_queue~0.base| (store (select (store (store .cse11 |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse13 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse4 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse1 (store .cse10 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse2 (select .cse6 .cse7))) (let ((.cse3 (select (store (store .cse1 |c_~#g_queue~0.base| (store .cse9 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse2 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 .cse2 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse5 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse6 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse2 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse7) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse8) (+ (select .cse3 |c_~#g_queue~0.offset|) 1)))))) (< v_ArrVal_1528 (+ .cse15 1)) (not (= (mod (+ .cse16 (* (select .cse17 .cse18) 4294967295)) 4294967296) (mod (select .cse17 .cse19) 4294967296))) (= (mod (+ (* 4294967295 (select .cse9 .cse18)) .cse15) 4294967296) (mod (select .cse9 .cse19) 4294967296)))))))))))))) (or .cse0 (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse29))) (let ((.cse43 (let ((.cse49 (store |c_#memory_$Pointer$.base| .cse48 v_ArrVal_1505))) (store .cse49 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse49 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510))))) (let ((.cse46 (let ((.cse47 (store |c_#memory_int| .cse48 v_ArrVal_1506))) (store .cse47 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse47 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509)))) (.cse40 (store .cse43 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse41 (select .cse40 |c_~#g_queue~0.base|)) (.cse44 (store .cse46 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse33 (select .cse44 |c_~#g_queue~0.base|)) (.cse42 (select .cse41 .cse7))) (let ((.cse39 (store .cse46 .cse42 v_ArrVal_1517)) (.cse32 (select .cse33 |c_~#g_queue~0.offset|))) (let ((.cse31 (select (store (store .cse39 |c_~#g_queue~0.base| (let ((.cse45 (+ .cse32 1))) (store (select (store (store .cse44 |c_~#g_queue~0.base| (store .cse33 |c_~#g_queue~0.offset| .cse45)) .cse42 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse4 .cse45))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse30 (select .cse31 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse30 (* 4294967295 (select .cse31 .cse18))) 4294967296) (mod (select .cse31 .cse19) 4294967296)) (< v_ArrVal_1528 (+ .cse30 1)) (not (= (mod (+ .cse32 (* (select .cse33 .cse18) 4294967295)) 4294967296) (mod (select .cse33 .cse19) 4294967296))) (let ((.cse37 (store .cse43 .cse42 v_ArrVal_1518))) (let ((.cse38 (select (store (store .cse37 |c_~#g_queue~0.base| (store (select (store (store .cse40 |c_~#g_queue~0.base| (store .cse41 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse42 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse4 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse34 (store .cse39 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse35 (select .cse38 .cse7))) (let ((.cse36 (select (store (store .cse34 |c_~#g_queue~0.base| (store .cse31 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse35 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse34 .cse35 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse36 .cse4 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse37 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse38 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse35 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse7) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse8) (+ (select .cse36 |c_~#g_queue~0.offset|) 1)))))))))))))))))))) is different from false [2025-04-25 04:09:35,285 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|)) (.cse25 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse2 (+ |c_~#g_queue~0.offset| 12)) (.cse3 (+ |c_~#g_queue~0.offset| 20)) (.cse13 (+ |c_~#g_queue~0.offset| 8)) (.cse9 (+ |c_~#g_queue~0.offset| 4)) (.cse12 (+ |c_~#g_queue~0.offset| 16)) (.cse24 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse22 (select .cse25 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse26 (= |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (select .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (and (or (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_$Pointer$.base| .cse22 v_ArrVal_1505) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse25 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_5)) .cse22 v_ArrVal_1505) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510)))) (let ((.cse21 (store (store |c_#memory_int| .cse22 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1))) .cse22 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509))) (.cse15 (store .cse18 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse16 (select .cse15 |c_~#g_queue~0.base|)) (.cse19 (store .cse21 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse4 (select .cse19 |c_~#g_queue~0.base|)) (.cse17 (select .cse16 .cse12))) (let ((.cse14 (store .cse21 .cse17 v_ArrVal_1517)) (.cse5 (select .cse4 |c_~#g_queue~0.offset|))) (let ((.cse1 (select (store (store .cse14 |c_~#g_queue~0.base| (let ((.cse20 (+ .cse5 1))) (store (select (store (store .cse19 |c_~#g_queue~0.base| (store .cse4 |c_~#g_queue~0.offset| .cse20)) .cse17 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse20))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse1 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse0 (* 4294967295 (select .cse1 .cse2))) 4294967296) (mod (select .cse1 .cse3) 4294967296)) (< v_ArrVal_1528 (+ .cse0 1)) (not (= (mod (+ (* (select .cse4 .cse2) 4294967295) .cse5) 4294967296) (mod (select .cse4 .cse3) 4294967296))) (let ((.cse10 (store .cse18 .cse17 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store .cse15 |c_~#g_queue~0.base| (store .cse16 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse17 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse14 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse13) (+ (select .cse8 |c_~#g_queue~0.offset|) 1))))))))))))))) (not .cse26)) (or (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse40 (let ((.cse45 (store |c_#memory_$Pointer$.base| .cse22 v_ArrVal_1505))) (store .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510))))) (let ((.cse43 (let ((.cse44 (store |c_#memory_int| .cse22 v_ArrVal_1506))) (store .cse44 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse44 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509)))) (.cse37 (store .cse40 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse38 (select .cse37 |c_~#g_queue~0.base|)) (.cse41 (store .cse43 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse30 (select .cse41 |c_~#g_queue~0.base|)) (.cse39 (select .cse38 .cse12))) (let ((.cse36 (store .cse43 .cse39 v_ArrVal_1517)) (.cse29 (select .cse30 |c_~#g_queue~0.offset|))) (let ((.cse28 (select (store (store .cse36 |c_~#g_queue~0.base| (let ((.cse42 (+ .cse29 1))) (store (select (store (store .cse41 |c_~#g_queue~0.base| (store .cse30 |c_~#g_queue~0.offset| .cse42)) .cse39 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse42))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse27 (select .cse28 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse27 (* 4294967295 (select .cse28 .cse2))) 4294967296) (mod (select .cse28 .cse3) 4294967296)) (< v_ArrVal_1528 (+ .cse27 1)) (not (= (mod (+ .cse29 (* (select .cse30 .cse2) 4294967295)) 4294967296) (mod (select .cse30 .cse3) 4294967296))) (let ((.cse34 (store .cse40 .cse39 v_ArrVal_1518))) (let ((.cse35 (select (store (store .cse34 |c_~#g_queue~0.base| (store (select (store (store .cse37 |c_~#g_queue~0.base| (store .cse38 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse39 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse31 (store .cse36 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse32 (select .cse35 .cse12))) (let ((.cse33 (select (store (store .cse31 |c_~#g_queue~0.base| (store .cse28 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse32 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse31 .cse32 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse33 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse34 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse35 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse32 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse13) (+ (select .cse33 |c_~#g_queue~0.offset|) 1))))))))))))))) .cse26)))) is different from false [2025-04-25 04:09:35,779 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse44 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|)) (.cse45 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse4 (+ |c_~#g_queue~0.offset| 20)) (.cse3 (+ |c_~#g_queue~0.offset| 12)) (.cse14 (+ |c_~#g_queue~0.offset| 8)) (.cse10 (+ |c_~#g_queue~0.offset| 4)) (.cse13 (+ |c_~#g_queue~0.offset| 16)) (.cse25 (select .cse45 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse24 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse0 (= |c_writerThread1of2ForFork0_vatomic32_read_#t~mem436#1| (select .cse44 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (and (or .cse0 (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse19 (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse25 v_ArrVal_1505))) (store .cse26 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse26 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510))))) (let ((.cse22 (let ((.cse23 (store |c_#memory_int| .cse25 v_ArrVal_1506))) (store .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509)))) (.cse16 (store .cse19 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse17 (select .cse16 |c_~#g_queue~0.base|)) (.cse20 (store .cse22 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse6 (select .cse20 |c_~#g_queue~0.base|)) (.cse18 (select .cse17 .cse13))) (let ((.cse15 (store .cse22 .cse18 v_ArrVal_1517)) (.cse5 (select .cse6 |c_~#g_queue~0.offset|))) (let ((.cse2 (select (store (store .cse15 |c_~#g_queue~0.base| (let ((.cse21 (+ .cse5 1))) (store (select (store (store .cse20 |c_~#g_queue~0.base| (store .cse6 |c_~#g_queue~0.offset| .cse21)) .cse18 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse10 .cse21))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse1 (select .cse2 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse1 (* 4294967295 (select .cse2 .cse3))) 4294967296) (mod (select .cse2 .cse4) 4294967296)) (< v_ArrVal_1528 (+ .cse1 1)) (not (= (mod (+ .cse5 (* (select .cse6 .cse3) 4294967295)) 4294967296) (mod (select .cse6 .cse4) 4294967296))) (let ((.cse11 (store .cse19 .cse18 v_ArrVal_1518))) (let ((.cse12 (select (store (store .cse11 |c_~#g_queue~0.base| (store (select (store (store .cse16 |c_~#g_queue~0.base| (store .cse17 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse18 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse10 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse7 (store .cse15 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse8 (select .cse12 .cse13))) (let ((.cse9 (select (store (store .cse7 |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse8 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse7 .cse8 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse9 .cse10 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse11 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse8 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse13) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse14) (+ (select .cse9 |c_~#g_queue~0.offset|) 1)))))))))))))))) (or (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_$Pointer$.base| .cse25 v_ArrVal_1505) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_5)) .cse25 v_ArrVal_1505) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510)))) (let ((.cse43 (store (store |c_#memory_int| .cse25 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse44 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| (+ |c_writerThread1of2ForFork0_vatomic32_read_#t~mem436#1| 1))) .cse25 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509))) (.cse37 (store .cse40 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse38 (select .cse37 |c_~#g_queue~0.base|)) (.cse41 (store .cse43 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse27 (select .cse41 |c_~#g_queue~0.base|)) (.cse39 (select .cse38 .cse13))) (let ((.cse36 (store .cse43 .cse39 v_ArrVal_1517)) (.cse28 (select .cse27 |c_~#g_queue~0.offset|))) (let ((.cse30 (select (store (store .cse36 |c_~#g_queue~0.base| (let ((.cse42 (+ .cse28 1))) (store (select (store (store .cse41 |c_~#g_queue~0.base| (store .cse27 |c_~#g_queue~0.offset| .cse42)) .cse39 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse10 .cse42))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse29 (select .cse30 |c_~#g_queue~0.offset|))) (or (not (= (mod (select .cse27 .cse4) 4294967296) (mod (+ .cse28 (* 4294967295 (select .cse27 .cse3))) 4294967296))) (< v_ArrVal_1528 (+ .cse29 1)) (= (mod (select .cse30 .cse4) 4294967296) (mod (+ (* 4294967295 (select .cse30 .cse3)) .cse29) 4294967296)) (let ((.cse34 (store .cse40 .cse39 v_ArrVal_1518))) (let ((.cse35 (select (store (store .cse34 |c_~#g_queue~0.base| (store (select (store (store .cse37 |c_~#g_queue~0.base| (store .cse38 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse39 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse10 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse31 (store .cse36 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse32 (select .cse35 .cse13))) (let ((.cse33 (select (store (store .cse31 |c_~#g_queue~0.base| (store .cse30 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse32 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse31 .cse32 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse33 .cse10 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse34 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse35 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse32 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse13) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse14) (+ (select .cse33 |c_~#g_queue~0.offset|) 1))))))))))))))) (not .cse0))))) is different from false [2025-04-25 04:09:35,958 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|)) (.cse24 (select (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_read_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_read_~a#1.offset|)) (.cse23 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse27 (= .cse24 (select .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse3 (+ |c_~#g_queue~0.offset| 12)) (.cse1 (+ |c_~#g_queue~0.offset| 20)) (.cse11 (+ |c_~#g_queue~0.offset| 8)) (.cse7 (+ |c_~#g_queue~0.offset| 4)) (.cse10 (+ |c_~#g_queue~0.offset| 16)) (.cse25 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse22 (select .cse26 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (and (or (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_$Pointer$.base| .cse22 v_ArrVal_1505) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse26 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_5)) .cse22 v_ArrVal_1505) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse25 v_ArrVal_1510)))) (let ((.cse21 (store (store |c_#memory_int| .cse22 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| (+ .cse24 1))) .cse22 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse25 v_ArrVal_1509))) (.cse14 (store .cse17 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse15 (select .cse14 |c_~#g_queue~0.base|)) (.cse19 (store .cse21 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse0 (select .cse19 |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse10))) (let ((.cse13 (store .cse21 .cse16 v_ArrVal_1517)) (.cse2 (select .cse0 |c_~#g_queue~0.offset|))) (let ((.cse12 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse20 (+ .cse2 1))) (store (select (store (store .cse19 |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| .cse20)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse7 .cse20))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse18 (select .cse12 |c_~#g_queue~0.offset|))) (or (not (= (mod (select .cse0 .cse1) 4294967296) (mod (+ .cse2 (* 4294967295 (select .cse0 .cse3))) 4294967296))) (let ((.cse8 (store .cse17 .cse16 v_ArrVal_1518))) (let ((.cse9 (select (store (store .cse8 |c_~#g_queue~0.base| (store (select (store (store .cse14 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse4 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse5 (select .cse9 .cse10))) (let ((.cse6 (select (store (store .cse4 |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse5 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse4 .cse5 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse8 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse9 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse10) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse11) (+ (select .cse6 |c_~#g_queue~0.offset|) 1)))))) (= (mod (+ (* 4294967295 (select .cse12 .cse3)) .cse18) 4294967296) (mod (select .cse12 .cse1) 4294967296)) (< v_ArrVal_1528 (+ .cse18 1))))))))))) (not .cse27)) (or .cse27 (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse41 (let ((.cse46 (store |c_#memory_$Pointer$.base| .cse22 v_ArrVal_1505))) (store .cse46 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse46 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse25 v_ArrVal_1510))))) (let ((.cse44 (let ((.cse45 (store |c_#memory_int| .cse22 v_ArrVal_1506))) (store .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse25 v_ArrVal_1509)))) (.cse38 (store .cse41 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse39 (select .cse38 |c_~#g_queue~0.base|)) (.cse42 (store .cse44 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse31 (select .cse42 |c_~#g_queue~0.base|)) (.cse40 (select .cse39 .cse10))) (let ((.cse37 (store .cse44 .cse40 v_ArrVal_1517)) (.cse30 (select .cse31 |c_~#g_queue~0.offset|))) (let ((.cse29 (select (store (store .cse37 |c_~#g_queue~0.base| (let ((.cse43 (+ .cse30 1))) (store (select (store (store .cse42 |c_~#g_queue~0.base| (store .cse31 |c_~#g_queue~0.offset| .cse43)) .cse40 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse7 .cse43))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse28 (select .cse29 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse28 (* 4294967295 (select .cse29 .cse3))) 4294967296) (mod (select .cse29 .cse1) 4294967296)) (< v_ArrVal_1528 (+ .cse28 1)) (not (= (mod (+ .cse30 (* (select .cse31 .cse3) 4294967295)) 4294967296) (mod (select .cse31 .cse1) 4294967296))) (let ((.cse35 (store .cse41 .cse40 v_ArrVal_1518))) (let ((.cse36 (select (store (store .cse35 |c_~#g_queue~0.base| (store (select (store (store .cse38 |c_~#g_queue~0.base| (store .cse39 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse40 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse32 (store .cse37 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse33 (select .cse36 .cse10))) (let ((.cse34 (select (store (store .cse32 |c_~#g_queue~0.base| (store .cse29 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse33 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse32 .cse33 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse34 .cse7 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse35 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse36 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse33 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse10) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse11) (+ (select .cse34 |c_~#g_queue~0.offset|) 1))))))))))))))))))) is different from false [2025-04-25 04:09:36,015 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse21 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|)) (.cse6 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse20 (select .cse21 .cse6))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse20 v_ArrVal_1505)) (.cse3 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse10 (select (store (store .cse9 |c_~#g_queue~0.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse21 |c_~#g_queue~0.offset| v_DerPreprocessor_5)) .cse20 v_ArrVal_1505) |c_~#g_queue~0.base|) .cse3 v_ArrVal_1510)) |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base|)) (.cse17 (store |c_#memory_int| .cse20 v_ArrVal_1506))) (let ((.cse16 (select (store (store .cse17 |c_~#g_queue~0.base| (store (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (let ((.cse19 (select |c_#memory_int| |c_~#g_queue~0.base|))) (store .cse19 |c_~#g_queue~0.offset| (+ (select .cse19 |c_~#g_queue~0.offset|) 1)))) .cse20 v_ArrVal_1506) |c_~#g_queue~0.base|) .cse3 v_ArrVal_1509)) |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base|)) (.cse11 (select .cse10 .cse6))) (let ((.cse8 (store .cse17 .cse11 v_ArrVal_1517)) (.cse15 (select .cse16 |c_~#g_queue~0.offset|))) (let ((.cse7 (select (store (store .cse8 |c_~#g_queue~0.base| (let ((.cse18 (+ .cse15 1))) (store (select (store (store (store .cse17 |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base| (store .cse16 |c_~#g_queue~0.offset| .cse18)) .cse11 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse3 .cse18))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse12 (select .cse7 |c_~#g_queue~0.offset|)) (.cse14 (+ |c_~#g_queue~0.offset| 12)) (.cse13 (+ |c_~#g_queue~0.offset| 20))) (or (let ((.cse4 (store .cse9 .cse11 v_ArrVal_1518))) (let ((.cse5 (select (store (store .cse4 |c_~#g_queue~0.base| (store (select (store (store (store .cse9 |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base| (store .cse10 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse11 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse3 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse0 (store .cse8 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse1 (select .cse5 .cse6))) (let ((.cse2 (select (store (store .cse0 |c_~#g_queue~0.base| (store .cse7 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse1 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse0 .cse1 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse4 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse1 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse6) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse2 |c_~#g_queue~0.offset|) 1)))))) (< v_ArrVal_1528 (+ .cse12 1)) (= (mod (select .cse7 .cse13) 4294967296) (mod (+ .cse12 (* (select .cse7 .cse14) 4294967295)) 4294967296)) (not (= (mod (+ .cse15 (* 4294967295 (select .cse16 .cse14))) 4294967296) (mod (select .cse16 .cse13) 4294967296))))))))))))) is different from false [2025-04-25 04:09:37,501 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1499))) (let ((.cse23 (select .cse22 |c_~#g_queue~0.base|)) (.cse10 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse21 (select .cse23 .cse10))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse21 v_ArrVal_1505)) (.cse7 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse13 (select (store (store .cse12 |c_~#g_queue~0.base| (store (select (store (store .cse22 |c_~#g_queue~0.base| (store .cse23 |c_~#g_queue~0.offset| v_DerPreprocessor_5)) .cse21 v_ArrVal_1505) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1510)) |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base|)) (.cse17 (store |c_#memory_int| .cse21 v_ArrVal_1506))) (let ((.cse15 (select (store (store .cse17 |c_~#g_queue~0.base| (store (select (store (let ((.cse19 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1500))) (store .cse19 |c_~#g_queue~0.base| (let ((.cse20 (select .cse19 |c_~#g_queue~0.base|))) (store .cse20 |c_~#g_queue~0.offset| (+ (select .cse20 |c_~#g_queue~0.offset|) 1))))) .cse21 v_ArrVal_1506) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1509)) |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base|)) (.cse14 (select .cse13 .cse10))) (let ((.cse11 (store .cse17 .cse14 v_ArrVal_1517)) (.cse16 (select .cse15 |c_~#g_queue~0.offset|))) (let ((.cse0 (select (store (store .cse11 |c_~#g_queue~0.base| (let ((.cse18 (+ .cse16 1))) (store (select (store (store (store .cse17 |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| .cse18)) .cse14 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse7 .cse18))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse3 (+ |c_~#g_queue~0.offset| 20)) (.cse1 (+ |c_~#g_queue~0.offset| 12)) (.cse2 (select .cse0 |c_~#g_queue~0.offset|))) (or (= (mod (+ (* 4294967295 (select .cse0 .cse1)) .cse2) 4294967296) (mod (select .cse0 .cse3) 4294967296)) (let ((.cse8 (store .cse12 .cse14 v_ArrVal_1518))) (let ((.cse9 (select (store (store .cse8 |c_~#g_queue~0.base| (store (select (store (store (store .cse12 |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base| (store .cse13 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse14 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse4 (store .cse11 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse5 (select .cse9 .cse10))) (let ((.cse6 (select (store (store .cse4 |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse5 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse4 .cse5 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse8 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse9 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse10) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse6 |c_~#g_queue~0.offset|) 1)))))) (not (= (mod (select .cse15 .cse3) 4294967296) (mod (+ (* 4294967295 (select .cse15 .cse1)) .cse16) 4294967296))) (< v_ArrVal_1528 (+ .cse2 1))))))))))))) is different from false [2025-04-25 04:09:38,100 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1497))) (let ((.cse23 (store .cse25 |c_~#g_val~0.base| v_ArrVal_1499))) (let ((.cse24 (select .cse23 |c_~#g_queue~0.base|)) (.cse12 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse22 (select .cse24 .cse12))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1498)) (.cse14 (store .cse25 .cse22 v_ArrVal_1505)) (.cse9 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse15 (select (store (store .cse14 |c_~#g_queue~0.base| (store (select (store (store .cse23 |c_~#g_queue~0.base| (store .cse24 |c_~#g_queue~0.offset| v_DerPreprocessor_5)) .cse22 v_ArrVal_1505) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1510)) |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base|)) (.cse17 (store .cse21 .cse22 v_ArrVal_1506))) (let ((.cse1 (select (store (store .cse17 |c_~#g_queue~0.base| (store (select (store (let ((.cse19 (store .cse21 |c_~#g_val~0.base| v_ArrVal_1500))) (store .cse19 |c_~#g_queue~0.base| (let ((.cse20 (select .cse19 |c_~#g_queue~0.base|))) (store .cse20 |c_~#g_queue~0.offset| (+ (select .cse20 |c_~#g_queue~0.offset|) 1))))) .cse22 v_ArrVal_1506) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1509)) |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse12))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_1517)) (.cse3 (select .cse1 |c_~#g_queue~0.offset|))) (let ((.cse5 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse18 (+ .cse3 1))) (store (select (store (store (store .cse17 |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| .cse18)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse18))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse4 (+ |c_~#g_queue~0.offset| 12)) (.cse0 (select .cse5 |c_~#g_queue~0.offset|)) (.cse2 (+ |c_~#g_queue~0.offset| 20))) (or (< v_ArrVal_1528 (+ .cse0 1)) (not (= (mod (select .cse1 .cse2) 4294967296) (mod (+ .cse3 (* (select .cse1 .cse4) 4294967295)) 4294967296))) (= (mod (+ (* 4294967295 (select .cse5 .cse4)) .cse0) 4294967296) (mod (select .cse5 .cse2) 4294967296)) (let ((.cse10 (store .cse14 .cse16 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store (store .cse14 |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))))))))))))) is different from false [2025-04-25 04:09:44,190 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 04:09:44,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 8370 treesize of output 5646 [2025-04-25 04:09:44,618 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 04:09:44,620 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 479169 treesize of output 475511 [2025-04-25 04:09:47,544 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 04:09:47,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 153883 treesize of output 152893 [2025-04-25 04:09:48,002 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2068 treesize of output 1884 [2025-04-25 04:09:48,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2274 treesize of output 2154 [2025-04-25 04:09:48,091 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 1804 treesize of output 1740 [2025-04-25 04:09:48,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2090 treesize of output 1994 [2025-04-25 04:09:48,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2330 treesize of output 2270 [2025-04-25 04:09:48,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 387 [2025-04-25 04:09:48,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1596 treesize of output 1444 [2025-04-25 04:09:48,420 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 330 [2025-04-25 04:09:48,470 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1213 treesize of output 1149 [2025-04-25 04:09:48,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1380 treesize of output 1304 [2025-04-25 04:09:48,567 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1304 treesize of output 1152 [2025-04-25 04:09:48,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 150 [2025-04-25 04:09:52,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2025-04-25 04:09:52,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370084 treesize of output 368804 [2025-04-25 04:09:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2025-04-25 04:09:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652853264] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 04:09:54,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 04:09:54,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 25, 59] total 142 [2025-04-25 04:09:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321133887] [2025-04-25 04:09:54,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 04:09:54,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2025-04-25 04:09:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:09:54,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2025-04-25 04:09:54,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=884, Invalid=14356, Unknown=88, NotChecked=4978, Total=20306 [2025-04-25 04:09:54,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:09:54,343 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:09:54,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 3.3216783216783217) internal successors, (475), 142 states have internal predecessors, (475), 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 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:09:54,344 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:13:27,757 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_~#g_queue~0.offset| 8)) (.cse7 (+ |c_~#g_queue~0.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse2 (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_ArrVal_1539 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~next~0#1|) (let ((.cse13 (select (let ((.cse14 (store |c_#memory_int| (select .cse0 (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|)) v_ArrVal_1539))) (store .cse14 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse14 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4) |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |c_~#g_queue~0.base|))) (< (select .cse13 .cse11) (select .cse13 .cse7)))))) (.cse1 (select |c_#memory_int| |c_~#g_queue~0.base|))) (and (not (= (select .cse0 16) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|)) (not (= (select .cse1 4) (select .cse1 8))) (or .cse2 (not (= |c_writerThread2of2ForFork0_bounded_mpmc_enq_#t~ret765#1| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~curr~0#1|))) (= |c_~#g_queue~0.offset| 0) (not (= |c_writerThread2of2ForFork0_bounded_mpmc_enq_~next~0#1| (select (select |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) 8))) (or .cse2 (not (= |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~exp~2#1| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~curr~0#1|))) (= |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 0) (= |c_~#g_queue~0.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1524))) (let ((.cse12 (select .cse4 |c_~#g_queue~0.base|))) (let ((.cse3 (select .cse12 |c_~#g_queue~0.offset|))) (or (< v_ArrVal_1528 (+ .cse3 1)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1523))) (let ((.cse9 (select .cse8 |c_~#g_queue~0.base|)) (.cse10 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse5 (select .cse9 .cse10))) (let ((.cse6 (select (store (store .cse4 |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse5 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse4 .cse5 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store .cse8 |c_~#g_queue~0.base| (store .cse9 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse10) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse11) (+ (select .cse6 |c_~#g_queue~0.offset|) 1)))))) (= (mod (select .cse12 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ .cse3 (* 4294967295 (select .cse12 (+ |c_~#g_queue~0.offset| 12)))) 4294967296))))))) (not (= (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1) 0)) (< (select .cse1 .cse11) (select .cse1 .cse7))))) is different from false [2025-04-25 04:13:28,138 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_~#g_queue~0.offset| 8)) (.cse0 (select |c_#memory_int| |c_~#g_queue~0.base|)) (.cse5 (+ |c_~#g_queue~0.offset| 4))) (and (not (= (select .cse0 4) (select .cse0 8))) (= |c_~#g_queue~0.offset| 0) (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1524))) (let ((.cse10 (select .cse2 |c_~#g_queue~0.base|))) (let ((.cse1 (select .cse10 |c_~#g_queue~0.offset|))) (or (< v_ArrVal_1528 (+ .cse1 1)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1523))) (let ((.cse7 (select .cse6 |c_~#g_queue~0.base|)) (.cse8 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse3 (select .cse7 .cse8))) (let ((.cse4 (select (store (store .cse2 |c_~#g_queue~0.base| (store .cse10 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse3 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse2 .cse3 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse7 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse3 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse8) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse9) (+ (select .cse4 |c_~#g_queue~0.offset|) 1)))))) (= (mod (select .cse10 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ .cse1 (* 4294967295 (select .cse10 (+ |c_~#g_queue~0.offset| 12)))) 4294967296))))))) (< (select .cse0 .cse9) (select .cse0 .cse5)))) is different from false [2025-04-25 04:13:29,747 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#g_queue~0.offset| 16)) (.cse4 (+ |c_~#g_queue~0.offset| 8))) (and (let ((.cse5 (select |c_#memory_int| |c_~#g_queue~0.base|))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.offset|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse2 .cse3))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse0 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse1 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse0 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse1 |c_~#g_queue~0.offset|) 1))))) (< v_ArrVal_1528 (+ .cse6 1)))) (= (mod (select .cse5 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ (* (select .cse5 (+ |c_~#g_queue~0.offset| 12)) 4294967295) .cse6) 4294967296))))) (let ((.cse12 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1531 Int) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (< v_ArrVal_1528 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse9 (select .cse10 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse11 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_int| .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_ArrVal_1528)) .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1534)))) (let ((.cse8 (select .cse7 |c_~#g_queue~0.base|))) (< (select (select (store (store .cse7 |c_~#g_queue~0.base| (store .cse8 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1529) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse10 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_3)) .cse9 v_ArrVal_1529) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1531)) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))) (= (mod (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (* 4294967295 (select (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_read_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_read_~a#1.offset|))) 4294967296) (mod (select .cse12 (+ 20 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)) 4294967296)) (not (= |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (select .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))))))) is different from false [2025-04-25 04:13:29,757 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#g_queue~0.offset| 16)) (.cse4 (+ |c_~#g_queue~0.offset| 8))) (and (let ((.cse5 (select |c_#memory_int| |c_~#g_queue~0.base|))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.offset|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse2 .cse3))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse0 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse1 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse0 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse1 |c_~#g_queue~0.offset|) 1))))) (< v_ArrVal_1528 (+ .cse6 1)))) (= (mod (select .cse5 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ (* (select .cse5 (+ |c_~#g_queue~0.offset| 12)) 4294967295) .cse6) 4294967296))))) (let ((.cse12 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1531 Int) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (< v_ArrVal_1528 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse9 (select .cse10 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse11 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_int| .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_ArrVal_1528)) .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1534)))) (let ((.cse8 (select .cse7 |c_~#g_queue~0.base|))) (< (select (select (store (store .cse7 |c_~#g_queue~0.base| (store .cse8 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1529) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse10 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_3)) .cse9 v_ArrVal_1529) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1531)) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))) (= (mod (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (* |c_writerThread1of2ForFork0_vatomic32_read_#t~mem436#1| 4294967295)) 4294967296) (mod (select .cse12 (+ 20 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)) 4294967296)) (not (= |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (select .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))))))) is different from false [2025-04-25 04:13:29,766 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#g_queue~0.offset| 16)) (.cse4 (+ |c_~#g_queue~0.offset| 8))) (and (let ((.cse5 (select |c_#memory_int| |c_~#g_queue~0.base|))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.offset|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse2 .cse3))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse0 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse1 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse0 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse1 |c_~#g_queue~0.offset|) 1))))) (< v_ArrVal_1528 (+ .cse6 1)))) (= (mod (select .cse5 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ (* (select .cse5 (+ |c_~#g_queue~0.offset| 12)) 4294967295) .cse6) 4294967296))))) (let ((.cse12 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1531 Int) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (< v_ArrVal_1528 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse9 (select .cse10 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse11 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_int| .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_ArrVal_1528)) .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1534)))) (let ((.cse8 (select .cse7 |c_~#g_queue~0.base|))) (< (select (select (store (store .cse7 |c_~#g_queue~0.base| (store .cse8 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1529) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse10 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_3)) .cse9 v_ArrVal_1529) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1531)) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))) (= (mod (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (* |c_writerThread1of2ForFork0_bounded_mpmc_enq_#t~ret763#1| 4294967295)) 4294967296) (mod |c_writerThread1of2ForFork0_bounded_mpmc_enq_#t~mem764#1| 4294967296)) (not (= |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (select .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))))))) is different from false [2025-04-25 04:13:33,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:13:33,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:33,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:13:33,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:33,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:33,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:33,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:33,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:13:33,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:13:33,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-04-25 04:13:33,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-25 04:13:33,418 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,SelfDestructingSolverStorable10 [2025-04-25 04:13:33,418 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:13:33,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:13:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1539042895, now seen corresponding path program 2 times [2025-04-25 04:13:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:13:33,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593238990] [2025-04-25 04:13:33,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 04:13:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:13:33,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 392 statements into 2 equivalence classes. [2025-04-25 04:13:33,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 110 of 392 statements. [2025-04-25 04:13:33,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 04:13:33,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:13:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-04-25 04:13:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:13:37,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593238990] [2025-04-25 04:13:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593238990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:13:37,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:13:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-04-25 04:13:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476965758] [2025-04-25 04:13:37,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:13:37,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-25 04:13:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:13:37,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-25 04:13:37,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-04-25 04:13:37,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:13:37,580 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:13:37,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 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 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2025-04-25 04:13:37,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:13:52,140 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 04:14:19,759 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-25 04:14:35,254 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_~#g_queue~0.offset| 8)) (.cse4 (+ |c_~#g_queue~0.offset| 4))) (and (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1524))) (let ((.cse9 (select .cse1 |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse9 |c_~#g_queue~0.offset|))) (or (< v_ArrVal_1528 (+ .cse0 1)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1523))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.base|)) (.cse7 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse2 (select .cse6 .cse7))) (let ((.cse3 (select (store (store .cse1 |c_~#g_queue~0.base| (store .cse9 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse2 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 .cse2 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store .cse5 |c_~#g_queue~0.base| (store .cse6 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse2 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse7) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse8) (+ (select .cse3 |c_~#g_queue~0.offset|) 1)))))) (= (mod (select .cse9 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ .cse0 (* 4294967295 (select .cse9 (+ |c_~#g_queue~0.offset| 12)))) 4294967296))))))) (let ((.cse10 (select |c_#memory_int| |c_~#g_queue~0.base|))) (< (select .cse10 .cse8) (select .cse10 .cse4))))) is different from false [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2025-04-25 04:14:35,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:14:35,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-25 04:14:35,944 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:14:35,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:14:35,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1107115512, now seen corresponding path program 3 times [2025-04-25 04:14:35,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:14:35,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503203229] [2025-04-25 04:14:35,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 04:14:35,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:14:35,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 195 statements into 4 equivalence classes. [2025-04-25 04:14:36,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 101 of 195 statements. [2025-04-25 04:14:36,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-25 04:14:36,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:14:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-04-25 04:14:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:14:42,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503203229] [2025-04-25 04:14:42,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503203229] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:14:42,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:14:42,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-04-25 04:14:42,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154216141] [2025-04-25 04:14:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:14:42,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-25 04:14:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:14:42,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-25 04:14:42,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2025-04-25 04:14:42,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:14:42,552 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:14:42,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 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 04:14:42,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:14:42,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:42,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:14:42,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:42,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:42,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:42,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:42,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:42,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:42,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2025-04-25 04:14:42,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:14:42,553 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2025-04-25 04:14:49,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:14:49,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-25 04:14:49,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-25 04:14:49,033 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:14:49,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:14:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1540291066, now seen corresponding path program 4 times [2025-04-25 04:14:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:14:49,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721756967] [2025-04-25 04:14:49,034 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 04:14:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:14:49,096 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 272 statements into 2 equivalence classes. [2025-04-25 04:14:49,135 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 272 of 272 statements. [2025-04-25 04:14:49,135 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 04:14:49,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:14:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-25 04:14:49,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:14:49,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721756967] [2025-04-25 04:14:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721756967] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 04:14:49,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 04:14:49,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 04:14:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086101573] [2025-04-25 04:14:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 04:14:49,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 04:14:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 04:14:49,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 04:14:49,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-25 04:14:49,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:14:49,454 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 04:14:49,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2025-04-25 04:14:49,455 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-25 04:14:49,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-25 04:14:49,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 04:14:49,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-25 04:14:49,861 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-25 04:14:49,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 04:14:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash -518318493, now seen corresponding path program 5 times [2025-04-25 04:14:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 04:14:49,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209232531] [2025-04-25 04:14:49,861 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 04:14:49,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 04:14:49,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 156 statements into 2 equivalence classes. [2025-04-25 04:14:49,909 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 156 statements. [2025-04-25 04:14:49,909 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 04:14:49,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:14:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 04:14:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 04:14:50,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209232531] [2025-04-25 04:14:50,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209232531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 04:14:50,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207397308] [2025-04-25 04:14:50,978 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 04:14:50,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 04:14:50,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:14:50,980 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 04:14:50,981 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 04:14:51,216 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 156 statements into 2 equivalence classes. [2025-04-25 04:14:51,302 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 156 statements. [2025-04-25 04:14:51,302 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 04:14:51,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 04:14:51,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 179 conjuncts are in the unsatisfiable core [2025-04-25 04:14:51,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 04:14:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 04:14:51,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 04:14:52,791 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 04:14:52,791 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 160 [2025-04-25 04:17:20,578 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 04:17:20,579 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 04:17:20,580 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-25 04:17:20,606 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 04:17:20,780 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,SelfDestructingSolverStorable14 [2025-04-25 04:17:20,921 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 04:17:20,922 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.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:294) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:196) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) 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) ... 92 more [2025-04-25 04:17:20,927 INFO L158 Benchmark]: Toolchain (without parser) took 533432.22ms. Allocated memory was 201.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 149.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-04-25 04:17:20,927 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 04:17:20,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2996.48ms. Allocated memory is still 201.3MB. Free memory was 149.3MB in the beginning and 121.1MB in the end (delta: 28.2MB). Peak memory consumption was 130.2MB. Max. memory is 16.1GB. [2025-04-25 04:17:20,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.66ms. Allocated memory is still 201.3MB. Free memory was 121.1MB in the beginning and 111.6MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-25 04:17:20,928 INFO L158 Benchmark]: Boogie Preprocessor took 61.23ms. Allocated memory is still 201.3MB. Free memory was 111.6MB in the beginning and 107.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 04:17:20,928 INFO L158 Benchmark]: RCFGBuilder took 1318.45ms. Allocated memory is still 201.3MB. Free memory was 107.5MB in the beginning and 106.1MB in the end (delta: 1.4MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2025-04-25 04:17:20,928 INFO L158 Benchmark]: TraceAbstraction took 528919.48ms. Allocated memory was 201.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 104.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-04-25 04:17:20,929 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.29ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2996.48ms. Allocated memory is still 201.3MB. Free memory was 149.3MB in the beginning and 121.1MB in the end (delta: 28.2MB). Peak memory consumption was 130.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.66ms. Allocated memory is still 201.3MB. Free memory was 121.1MB in the beginning and 111.6MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.23ms. Allocated memory is still 201.3MB. Free memory was 111.6MB in the beginning and 107.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1318.45ms. Allocated memory is still 201.3MB. Free memory was 107.5MB in the beginning and 106.1MB in the end (delta: 1.4MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * TraceAbstraction took 528919.48ms. Allocated memory was 201.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 104.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4308]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] - GenericResultAtLocation [Line: 4310]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] - GenericResultAtLocation [Line: 4315]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] - GenericResultAtLocation [Line: 4317]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] - GenericResultAtLocation [Line: 4323]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] - GenericResultAtLocation [Line: 4325]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] - GenericResultAtLocation [Line: 4331]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] - GenericResultAtLocation [Line: 4333]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] - GenericResultAtLocation [Line: 4339]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] - GenericResultAtLocation [Line: 4341]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] - GenericResultAtLocation [Line: 4347]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] - GenericResultAtLocation [Line: 4349]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] - GenericResultAtLocation [Line: 4355]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] - GenericResultAtLocation [Line: 4357]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] - GenericResultAtLocation [Line: 4363]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] - GenericResultAtLocation [Line: 4365]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] - GenericResultAtLocation [Line: 4370]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] - GenericResultAtLocation [Line: 4372]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] - GenericResultAtLocation [Line: 4377]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] - GenericResultAtLocation [Line: 4379]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] - GenericResultAtLocation [Line: 4384]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] - GenericResultAtLocation [Line: 4386]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] - GenericResultAtLocation [Line: 4391]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] - GenericResultAtLocation [Line: 4393]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] - GenericResultAtLocation [Line: 4398]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] - GenericResultAtLocation [Line: 4400]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] - GenericResultAtLocation [Line: 4405]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] - GenericResultAtLocation [Line: 4408]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] - GenericResultAtLocation [Line: 4414]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] - GenericResultAtLocation [Line: 4417]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] - GenericResultAtLocation [Line: 4423]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] - GenericResultAtLocation [Line: 4426]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] - GenericResultAtLocation [Line: 4432]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] - GenericResultAtLocation [Line: 4435]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] - GenericResultAtLocation [Line: 4441]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] - GenericResultAtLocation [Line: 4444]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] - GenericResultAtLocation [Line: 4450]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] - GenericResultAtLocation [Line: 4453]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] - GenericResultAtLocation [Line: 4460]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] - GenericResultAtLocation [Line: 4463]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] - GenericResultAtLocation [Line: 4470]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] - GenericResultAtLocation [Line: 4473]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] - GenericResultAtLocation [Line: 4480]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] - GenericResultAtLocation [Line: 4483]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] - GenericResultAtLocation [Line: 4490]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] - GenericResultAtLocation [Line: 4493]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] - GenericResultAtLocation [Line: 4500]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] - GenericResultAtLocation [Line: 4503]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] - GenericResultAtLocation [Line: 4510]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] - GenericResultAtLocation [Line: 4513]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] - GenericResultAtLocation [Line: 4519]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] - GenericResultAtLocation [Line: 4522]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] - GenericResultAtLocation [Line: 4528]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] - GenericResultAtLocation [Line: 4531]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] - GenericResultAtLocation [Line: 4537]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] - GenericResultAtLocation [Line: 4540]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] - GenericResultAtLocation [Line: 4546]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] - GenericResultAtLocation [Line: 4549]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] - GenericResultAtLocation [Line: 4555]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] - GenericResultAtLocation [Line: 4558]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] - GenericResultAtLocation [Line: 4564]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] - GenericResultAtLocation [Line: 4567]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] - GenericResultAtLocation [Line: 4573]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] - GenericResultAtLocation [Line: 4576]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] - GenericResultAtLocation [Line: 4582]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] - GenericResultAtLocation [Line: 4585]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] - GenericResultAtLocation [Line: 4591]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] - GenericResultAtLocation [Line: 4594]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] - GenericResultAtLocation [Line: 4600]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] - GenericResultAtLocation [Line: 4603]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] - GenericResultAtLocation [Line: 4609]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] - GenericResultAtLocation [Line: 4612]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] - GenericResultAtLocation [Line: 4618]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] - GenericResultAtLocation [Line: 4621]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] - GenericResultAtLocation [Line: 4627]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] - GenericResultAtLocation [Line: 4630]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] - GenericResultAtLocation [Line: 4636]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] - GenericResultAtLocation [Line: 4639]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] - GenericResultAtLocation [Line: 4645]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] - GenericResultAtLocation [Line: 4648]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] - GenericResultAtLocation [Line: 4654]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] - GenericResultAtLocation [Line: 4656]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] - GenericResultAtLocation [Line: 4662]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] - GenericResultAtLocation [Line: 4664]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] - GenericResultAtLocation [Line: 4670]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] - GenericResultAtLocation [Line: 4672]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] - GenericResultAtLocation [Line: 4678]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] - GenericResultAtLocation [Line: 4680]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] - GenericResultAtLocation [Line: 4686]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] - GenericResultAtLocation [Line: 4688]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] - GenericResultAtLocation [Line: 4694]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] - GenericResultAtLocation [Line: 4696]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] - GenericResultAtLocation [Line: 4702]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] - GenericResultAtLocation [Line: 4704]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] - GenericResultAtLocation [Line: 4710]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] - GenericResultAtLocation [Line: 4712]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] - GenericResultAtLocation [Line: 4718]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] - GenericResultAtLocation [Line: 4720]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] - GenericResultAtLocation [Line: 4726]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] - GenericResultAtLocation [Line: 4728]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 410, independent: 405, independent conditional: 0, independent unconditional: 405, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 410, independent: 405, independent conditional: 0, independent unconditional: 405, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 397, independent conditional: 0, independent unconditional: 397, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 402, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2140, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 2091, unknown conditional: 0, unknown unconditional: 2091] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 410, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 402, unknown conditional: 0, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 397, Positive conditional cache size: 0, Positive unconditional cache size: 397, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 2.2s, Number of persistent set computation: 21, Number of trivial persistent sets: 21, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 410, independent: 405, independent conditional: 0, independent unconditional: 405, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 410, independent: 405, independent conditional: 0, independent unconditional: 405, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 397, independent conditional: 0, independent unconditional: 397, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 402, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2140, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 2091, unknown conditional: 0, unknown unconditional: 2091] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 410, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 402, unknown conditional: 0, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 397, Positive conditional cache size: 0, Positive unconditional cache size: 397, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2, Independence queries for same thread: 0 - 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/libvsync/bounded_mpmc_check_full.i -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 f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --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 04:17:22,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 04:17:22,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-04-25 04:17:22,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 04:17:22,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 04:17:22,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 04:17:22,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 04:17:22,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 04:17:22,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 04:17:22,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 04:17:22,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 04:17:22,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 04:17:22,822 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 04:17:22,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 04:17:22,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 04:17:22,822 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 04:17:22,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 04:17:22,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 04:17:22,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 04:17:22,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 04:17:22,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 04:17:22,823 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-25 04:17:22,823 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-25 04:17:22,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 04:17:22,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 04:17:22,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 04:17:22,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 04:17:22,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 04:17:22,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 04:17:22,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 04:17:22,824 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 04:17:22,825 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 -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe 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 04:17:23,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 04:17:23,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 04:17:23,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 04:17:23,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 04:17:23,082 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 04:17:23,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-04-25 04:17:24,429 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9ca397fb5/d0bb81076d514cd6b8705e27d5934d76/FLAG57cc5cb1b [2025-04-25 04:17:24,803 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 04:17:24,805 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-04-25 04:17:24,841 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9ca397fb5/d0bb81076d514cd6b8705e27d5934d76/FLAG57cc5cb1b [2025-04-25 04:17:25,479 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9ca397fb5/d0bb81076d514cd6b8705e27d5934d76 [2025-04-25 04:17:25,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 04:17:25,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 04:17:25,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 04:17:25,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 04:17:25,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 04:17:25,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 04:17:25" (1/1) ... [2025-04-25 04:17:25,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1703b86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:25, skipping insertion in model container [2025-04-25 04:17:25,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 04:17:25" (1/1) ... [2025-04-25 04:17:25,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 04:17:27,480 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/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-04-25 04:17:27,482 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/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-04-25 04:17:27,515 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/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-04-25 04:17:27,516 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/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-04-25 04:17:27,518 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/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-04-25 04:17:27,518 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/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-04-25 04:17:27,518 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/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-04-25 04:17:27,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 04:17:27,533 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 04:17:27,653 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-04-25 04:17:27,655 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-04-25 04:17:27,655 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-04-25 04:17:27,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-04-25 04:17:27,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-04-25 04:17:27,657 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-04-25 04:17:27,657 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-04-25 04:17:27,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-04-25 04:17:27,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-04-25 04:17:27,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-04-25 04:17:27,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-04-25 04:17:27,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-04-25 04:17:27,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-04-25 04:17:27,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-04-25 04:17:27,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-04-25 04:17:27,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-04-25 04:17:27,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-04-25 04:17:27,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-04-25 04:17:27,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-04-25 04:17:27,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-04-25 04:17:27,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-04-25 04:17:27,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-04-25 04:17:27,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-04-25 04:17:27,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-04-25 04:17:27,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-04-25 04:17:27,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-04-25 04:17:27,662 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-04-25 04:17:27,663 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-04-25 04:17:27,663 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-04-25 04:17:27,663 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-04-25 04:17:27,664 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-04-25 04:17:27,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-04-25 04:17:27,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-04-25 04:17:27,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-04-25 04:17:27,665 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-04-25 04:17:27,666 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-04-25 04:17:27,666 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-04-25 04:17:27,667 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-04-25 04:17:27,667 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-04-25 04:17:27,668 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-04-25 04:17:27,668 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-04-25 04:17:27,668 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-04-25 04:17:27,669 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-04-25 04:17:27,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-04-25 04:17:27,670 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-04-25 04:17:27,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-04-25 04:17:27,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-04-25 04:17:27,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-04-25 04:17:27,671 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-04-25 04:17:27,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-04-25 04:17:27,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-04-25 04:17:27,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-04-25 04:17:27,699 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-04-25 04:17:27,700 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-04-25 04:17:27,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-04-25 04:17:27,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-04-25 04:17:27,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-04-25 04:17:27,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-04-25 04:17:27,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-04-25 04:17:27,706 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-04-25 04:17:27,706 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-04-25 04:17:27,706 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-04-25 04:17:27,706 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-04-25 04:17:27,707 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-04-25 04:17:27,707 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-04-25 04:17:27,707 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-04-25 04:17:27,707 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-04-25 04:17:27,708 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-04-25 04:17:27,708 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-04-25 04:17:27,708 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-04-25 04:17:27,708 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-04-25 04:17:27,709 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-04-25 04:17:27,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-04-25 04:17:27,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-04-25 04:17:27,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-04-25 04:17:27,710 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-04-25 04:17:27,711 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-04-25 04:17:27,711 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-04-25 04:17:27,711 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-04-25 04:17:27,712 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-04-25 04:17:27,712 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-04-25 04:17:27,712 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-04-25 04:17:27,713 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-04-25 04:17:27,713 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-04-25 04:17:27,713 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-04-25 04:17:27,714 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-04-25 04:17:27,714 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-04-25 04:17:27,715 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-04-25 04:17:27,715 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-04-25 04:17:27,715 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-04-25 04:17:27,715 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-04-25 04:17:27,715 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-04-25 04:17:27,716 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-04-25 04:17:27,716 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-04-25 04:17:27,716 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-04-25 04:17:27,716 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-04-25 04:17:27,716 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-04-25 04:17:27,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-04-25 04:17:27,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-04-25 04:17:27,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-04-25 04:17:27,759 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/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-04-25 04:17:27,760 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/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-04-25 04:17:27,771 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/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-04-25 04:17:27,772 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/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-04-25 04:17:27,772 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/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-04-25 04:17:27,773 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/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-04-25 04:17:27,774 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/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-04-25 04:17:27,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 04:17:27,953 INFO L204 MainTranslator]: Completed translation [2025-04-25 04:17:27,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27 WrapperNode [2025-04-25 04:17:27,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 04:17:27,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 04:17:27,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 04:17:27,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 04:17:27,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,061 INFO L138 Inliner]: procedures = 922, calls = 950, calls flagged for inlining = 815, calls inlined = 57, statements flattened = 625 [2025-04-25 04:17:28,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 04:17:28,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 04:17:28,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 04:17:28,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 04:17:28,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 04:17:28,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 04:17:28,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 04:17:28,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 04:17:28,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 04:17:27" (1/1) ... [2025-04-25 04:17:28,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 04:17:28,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 04:17:28,147 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 04:17:28,150 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 04:17:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 04:17:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-25 04:17:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 04:17:28,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 04:17:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-25 04:17:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-25 04:17:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-25 04:17:28,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-04-25 04:17:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-04-25 04:17:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-04-25 04:17:28,167 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-04-25 04:17:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-04-25 04:17:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-04-25 04:17:28,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-25 04:17:28,168 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 04:17:28,323 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 04:17:28,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 04:17:29,296 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 04:17:29,296 INFO L283 CfgBuilder]: Performing block encoding