./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:07:30,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:07:30,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:07:30,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:07:30,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:07:30,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:07:30,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:07:30,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:07:30,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:07:30,916 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:07:30,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:07:30,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:07:30,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:07:30,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:07:30,917 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:07:30,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:07:30,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:07:30,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:07:30,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:07:30,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:07:30,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:07:30,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:07:30,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:07:30,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:07:30,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:07:30,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:07:30,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:07:30,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:07:30,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:07:30,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:07:30,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:07:30,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:07:30,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:07:30,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:07:30,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2025-02-07 20:07:31,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:07:31,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:07:31,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:07:31,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:07:31,227 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:07:31,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-07 20:07:32,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bbf1e34c/907f479ac2584189b3826894f3c0e237/FLAG008feb378 [2025-02-07 20:07:32,710 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:07:32,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-07 20:07:32,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bbf1e34c/907f479ac2584189b3826894f3c0e237/FLAG008feb378 [2025-02-07 20:07:32,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0bbf1e34c/907f479ac2584189b3826894f3c0e237 [2025-02-07 20:07:32,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:07:32,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:07:32,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:07:32,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:07:32,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:07:32,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:07:32" (1/1) ... [2025-02-07 20:07:32,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b338f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:32, skipping insertion in model container [2025-02-07 20:07:32,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:07:32" (1/1) ... [2025-02-07 20:07:32,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:07:33,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-02-07 20:07:33,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-02-07 20:07:33,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-02-07 20:07:33,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-02-07 20:07:33,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-02-07 20:07:33,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-02-07 20:07:33,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:07:33,053 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:07:33,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-02-07 20:07:33,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-02-07 20:07:33,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-02-07 20:07:33,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-02-07 20:07:33,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-02-07 20:07:33,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-02-07 20:07:33,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:07:33,105 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:07:33,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33 WrapperNode [2025-02-07 20:07:33,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:07:33,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:07:33,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:07:33,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:07:33,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,144 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2025-02-07 20:07:33,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:07:33,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:07:33,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:07:33,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:07:33,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,164 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-02-07 20:07:33,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:07:33,173 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:07:33,173 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:07:33,173 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:07:33,173 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (1/1) ... [2025-02-07 20:07:33,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:07:33,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:33,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:07:33,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:07:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:07:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:07:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:07:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:07:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:07:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:07:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:07:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:07:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:07:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:07:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:07:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:07:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:07:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:07:33,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:07:33,301 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:07:33,302 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:07:33,434 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-07 20:07:33,434 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:07:33,441 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:07:33,441 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:07:33,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:07:33 BoogieIcfgContainer [2025-02-07 20:07:33,441 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:07:33,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:07:33,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:07:33,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:07:33,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:07:32" (1/3) ... [2025-02-07 20:07:33,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c7e88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:07:33, skipping insertion in model container [2025-02-07 20:07:33,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:07:33" (2/3) ... [2025-02-07 20:07:33,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c7e88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:07:33, skipping insertion in model container [2025-02-07 20:07:33,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:07:33" (3/3) ... [2025-02-07 20:07:33,448 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2025-02-07 20:07:33,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:07:33,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-token-1.i that has 1 procedures, 44 locations, 1 initial locations, 9 loop locations, and 6 error locations. [2025-02-07 20:07:33,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:07:33,503 INFO L333 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=PETRI_NET, 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;@5ebf4e6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:07:33,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-07 20:07:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 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-02-07 20:07:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:07:33,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:33,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:07:33,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:07:33,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1368149575, now seen corresponding path program 1 times [2025-02-07 20:07:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:33,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192522136] [2025-02-07 20:07:33,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:33,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:07:33,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:07:33,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:33,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:33,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192522136] [2025-02-07 20:07:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192522136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:33,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:07:33,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12620679] [2025-02-07 20:07:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:33,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:07:33,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:33,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:07:33,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:07:33,919 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-02-07 20:07:33,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:33,994 INFO L93 Difference]: Finished difference Result 85 states and 131 transitions. [2025-02-07 20:07:33,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:07:33,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-02-07 20:07:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:33,999 INFO L225 Difference]: With dead ends: 85 [2025-02-07 20:07:34,000 INFO L226 Difference]: Without dead ends: 38 [2025-02-07 20:07:34,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:34,003 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:34,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-07 20:07:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-07 20:07:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 37 states have internal predecessors, (40), 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-02-07 20:07:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-02-07 20:07:34,023 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 6 [2025-02-07 20:07:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:34,023 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-02-07 20:07:34,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-02-07 20:07:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-02-07 20:07:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:07:34,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:34,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:34,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:07:34,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:07:34,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash 535897151, now seen corresponding path program 1 times [2025-02-07 20:07:34,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:34,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231674488] [2025-02-07 20:07:34,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:34,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:07:34,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:07:34,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:34,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:34,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231674488] [2025-02-07 20:07:34,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231674488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:34,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:34,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:07:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313786356] [2025-02-07 20:07:34,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:34,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:07:34,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:34,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:07:34,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:07:34,152 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-07 20:07:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:34,214 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-02-07 20:07:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:34,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-02-07 20:07:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:34,216 INFO L225 Difference]: With dead ends: 58 [2025-02-07 20:07:34,217 INFO L226 Difference]: Without dead ends: 56 [2025-02-07 20:07:34,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:34,218 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 68 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:34,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:07:34,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-07 20:07:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2025-02-07 20:07:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 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-02-07 20:07:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-02-07 20:07:34,229 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 7 [2025-02-07 20:07:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:34,229 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-02-07 20:07:34,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-07 20:07:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-02-07 20:07:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:07:34,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:34,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:34,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:07:34,230 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:07:34,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:34,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1017311693, now seen corresponding path program 1 times [2025-02-07 20:07:34,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:34,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960561767] [2025-02-07 20:07:34,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:34,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:34,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:07:34,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:07:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:34,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:34,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:34,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960561767] [2025-02-07 20:07:34,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960561767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:34,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:34,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:07:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744833970] [2025-02-07 20:07:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:34,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:07:34,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:34,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:07:34,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:07:34,749 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-02-07 20:07:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:34,942 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-02-07 20:07:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:07:34,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 12 [2025-02-07 20:07:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:34,943 INFO L225 Difference]: With dead ends: 56 [2025-02-07 20:07:34,943 INFO L226 Difference]: Without dead ends: 54 [2025-02-07 20:07:34,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:07:34,944 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:34,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 109 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:34,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-07 20:07:34,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2025-02-07 20:07:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-02-07 20:07:34,950 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2025-02-07 20:07:34,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:34,950 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-02-07 20:07:34,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-02-07 20:07:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-02-07 20:07:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:07:34,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:34,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:34,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:07:34,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:07:34,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:34,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1017332547, now seen corresponding path program 1 times [2025-02-07 20:07:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:34,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678950179] [2025-02-07 20:07:34,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:34,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:07:34,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:07:34,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:34,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678950179] [2025-02-07 20:07:35,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678950179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:35,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:35,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:07:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711111739] [2025-02-07 20:07:35,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:35,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:07:35,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:35,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:07:35,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:35,012 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-07 20:07:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:35,069 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-02-07 20:07:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2025-02-07 20:07:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:35,070 INFO L225 Difference]: With dead ends: 46 [2025-02-07 20:07:35,070 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 20:07:35,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:07:35,071 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:35,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 96 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:07:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 20:07:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-07 20:07:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-02-07 20:07:35,083 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 12 [2025-02-07 20:07:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:35,083 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-02-07 20:07:35,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-07 20:07:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-02-07 20:07:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 20:07:35,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:35,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:35,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:07:35,084 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:07:35,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:35,085 INFO L85 PathProgramCache]: Analyzing trace with hash -392310435, now seen corresponding path program 1 times [2025-02-07 20:07:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148639652] [2025-02-07 20:07:35,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:35,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 20:07:35,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 20:07:35,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:35,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148639652] [2025-02-07 20:07:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148639652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:35,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:35,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:07:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159456115] [2025-02-07 20:07:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:35,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:07:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:35,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:07:35,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:07:35,503 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-02-07 20:07:35,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:35,647 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2025-02-07 20:07:35,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:07:35,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 16 [2025-02-07 20:07:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:35,648 INFO L225 Difference]: With dead ends: 68 [2025-02-07 20:07:35,648 INFO L226 Difference]: Without dead ends: 66 [2025-02-07 20:07:35,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:07:35,649 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:35,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 143 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-07 20:07:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2025-02-07 20:07:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 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-02-07 20:07:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-02-07 20:07:35,657 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2025-02-07 20:07:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:35,657 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-02-07 20:07:35,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-02-07 20:07:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-02-07 20:07:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:07:35,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:35,658 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:35,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:07:35,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:07:35,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1489126683, now seen corresponding path program 1 times [2025-02-07 20:07:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:35,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133704441] [2025-02-07 20:07:35,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:35,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:35,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:07:35,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:07:35,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:35,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:36,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:36,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133704441] [2025-02-07 20:07:36,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133704441] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:36,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499937421] [2025-02-07 20:07:36,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:36,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:36,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:36,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:07:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:07:36,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:07:36,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:07:36,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:36,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:36,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-07 20:07:36,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:36,245 INFO L378 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 11 treesize of output 7 [2025-02-07 20:07:36,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-07 20:07:36,300 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:07:36,323 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:07:36,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-07 20:07:36,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:36,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:36,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-02-07 20:07:36,350 INFO L378 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 16 treesize of output 11 [2025-02-07 20:07:36,358 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-07 20:07:36,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:36,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-07 20:07:36,370 INFO L378 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 5 treesize of output 3 [2025-02-07 20:07:36,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:36,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:36,550 INFO L349 Elim1Store]: treesize reduction 988, result has 2.1 percent of original size [2025-02-07 20:07:36,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 528 treesize of output 656 [2025-02-07 20:07:36,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:36,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:36,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:36,582 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:07:36,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2025-02-07 20:07:36,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:36,609 INFO L349 Elim1Store]: treesize reduction 56, result has 8.2 percent of original size [2025-02-07 20:07:36,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 55 [2025-02-07 20:07:36,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2025-02-07 20:07:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:36,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:07:36,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:36,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2025-02-07 20:07:36,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:36,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2025-02-07 20:07:37,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:37,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 63 [2025-02-07 20:07:37,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:37,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2025-02-07 20:07:38,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:38,296 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1767 treesize of output 1408 [2025-02-07 20:07:38,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2855 treesize of output 2235 [2025-02-07 20:07:38,325 INFO L378 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 2083 treesize of output 1991 [2025-02-07 20:07:38,358 INFO L378 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 1993 treesize of output 1987 [2025-02-07 20:07:38,387 INFO L378 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 1987 treesize of output 1977 [2025-02-07 20:07:45,715 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0))) (.cse3 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= 2 (select v_arrayElimArr_7 8))) (= 0 .cse0) (= 1 .cse0)))) (= v_prenex_25 v_arrayElimCell_15) (not (= (select |c_#valid| v_prenex_25) 0)))))) (or (and (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse3 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse4 0) (= .cse4 1)))))) (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse3 v_prenex_25))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_7 8))) (forall ((v_prenex_26 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse5 0) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse6 0) (= .cse6 1)))) (= .cse5 1)))))) (= v_prenex_25 v_arrayElimCell_16))))) (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse3 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse7 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse7 0) (= .cse7 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_28 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse9 (store .cse10 v_arrayElimCell_15 v_prenex_29))) (let ((.cse11 (select (select (store .cse9 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_28) 0)) (= (select (select (store .cse9 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse10 v_prenex_28 v_prenex_27) v_arrayElimCell_15 (store (select (store .cse9 v_prenex_28 v_prenex_27) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse11 0) (= .cse11 1)))))))) (or .cse8 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse14 (store .cse15 v_arrayElimCell_16 v_prenex_21))) (let ((.cse13 (select (select (store (store .cse15 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse14 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse12 (select (select (store .cse14 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse12 0) (= v_prenex_20 v_arrayElimCell_16) (= .cse13 1) (= .cse13 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse12 1))))))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse18 (store .cse17 v_arrayElimCell_15 v_ArrVal_338))) (let ((.cse16 (select (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse16 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse16 1) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15 (store (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15)))))))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_25 Int)) (or (= v_prenex_25 v_arrayElimCell_15) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse21 (select (select (store (store .cse20 v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse19 (select (select (store (store (store .cse20 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse19 0) (= .cse19 1)))) (= 0 .cse21) (= 1 .cse21))))) (not (= 2 (select v_arrayElimArr_7 8))))) (not (= (select |c_#valid| v_prenex_25) 0)))))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse23 (store v_prenex_27 8 2)) (.cse22 (store .cse24 v_arrayElimCell_16 v_prenex_29))) (or (= (select (select (store .cse22 v_prenex_28 .cse23) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse23) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse24 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse22 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse22 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_28) 0)))))) .cse8) (or .cse8 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse29 (store .cse28 v_arrayElimCell_16 v_prenex_21)) (.cse27 (store v_prenex_19 8 2))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse25 (select (select (store .cse29 v_prenex_20 .cse27) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse25 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse26 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse26 v_prenex_20 .cse27) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse28 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse29 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse25 1))))))) (or .cse8 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_16 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse30 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select .cse3 v_prenex_17) 0)) (= .cse30 0) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse30 1))))) (or .cse8 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse31 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= v_prenex_25 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_prenex_25) 0)) (= .cse31 0) (= .cse31 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))) (or .cse8 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse34 (store .cse33 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse32 (select (select (store .cse34 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse32 0) (= (select (select (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse34 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse32 1))))))) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse38 (store .cse37 v_arrayElimCell_16 v_ArrVal_338)) (.cse35 (store v_ArrVal_337 8 2))) (let ((.cse36 (select (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse35) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse35) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse36 0) (= (select (select (store (store .cse37 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse36 1)))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_23 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_23) 0)) (forall ((v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse41 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse43 (store .cse41 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse42 (store .cse41 v_arrayElimCell_15 v_prenex_24)) (.cse44 (store .cse43 v_arrayElimCell_16 v_prenex_24)) (.cse45 (store v_prenex_22 8 2))) (let ((.cse39 (select (select (store .cse44 v_prenex_23 .cse45) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse40 (select (select (store .cse42 v_prenex_23 .cse45) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse39 1) (= .cse40 1) (= .cse39 0) (= .cse40 0) (= (select (select (store (store .cse41 v_prenex_23 v_prenex_22) v_arrayElimCell_15 (store (select (store .cse42 v_prenex_23 v_prenex_22) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse43 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse44 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))))))))) (or (and (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse47 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse48 (store .cse47 v_arrayElimCell_16 v_prenex_21))) (let ((.cse46 (select (select (store .cse48 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse46 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store (store .cse47 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse48 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse46 1)))))) (not (= (select .cse3 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (not (= (select .cse3 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse52 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse51 (store .cse52 v_arrayElimCell_16 v_prenex_21))) (let ((.cse50 (select (select (store (store .cse52 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse51 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse49 (select (select (store .cse51 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse49 0) (= v_prenex_20 v_arrayElimCell_16) (= .cse50 1) (= .cse50 0) (= .cse49 1)))))))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int))) (let ((.cse57 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse56 (store v_prenex_19 8 2))) (let ((.cse54 (select (select (store .cse57 v_prenex_20 .cse56) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse53 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse57 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse53 0) (= .cse54 0) (= .cse54 1) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse55 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse56) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse55 0) (= .cse55 1)))) (= .cse53 1))))) (= v_prenex_20 v_arrayElimCell_16))) (not (= (select .cse3 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse61 (store v_prenex_19 8 2))) (let ((.cse58 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse59 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse60 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse58 0) (= .cse59 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse60 v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse58 1) (= .cse59 1))))) (not (= (select .cse3 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (not (= (select .cse3 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse65 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse66 (store .cse65 v_arrayElimCell_16 v_prenex_21)) (.cse64 (store v_prenex_19 8 2))) (let ((.cse63 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse62 (select (select (store .cse66 v_prenex_20 .cse64) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse62 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse63 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse63 v_prenex_20 .cse64) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse65 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse66 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse62 1))))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse68 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse69 (store .cse68 v_arrayElimCell_15 v_ArrVal_338))) (let ((.cse67 (select (select (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse67 0) (= .cse67 1) (= (select (select (store (store .cse68 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15 (store (select (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or .cse8 (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse71 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse72 (store .cse71 v_arrayElimCell_16 v_prenex_29))) (let ((.cse70 (select (select (store .cse72 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse70 1) (= .cse70 0) (= (select (select (store (store .cse71 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse72 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse72 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_28) 0)))))))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse74 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse75 (store .cse74 v_arrayElimCell_16 v_prenex_21))) (let ((.cse73 (select (select (store .cse75 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse73 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store (store .cse74 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse75 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse73 1)))))) .cse8) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse79 (store v_prenex_19 8 2))) (let ((.cse76 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse77 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse78 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse76 0) (= .cse77 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse78 v_prenex_20 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse76 1) (= .cse77 1))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_15) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse83 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse82 (store .cse83 v_arrayElimCell_15 v_prenex_21))) (let ((.cse81 (select (select (store (store .cse83 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse82 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse80 (select (select (store .cse82 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse80 0) (= .cse81 0) (= .cse81 1) (= .cse80 1)))))))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse88 (store .cse87 v_arrayElimCell_16 v_prenex_24)) (.cse84 (store v_prenex_22 8 2))) (let ((.cse85 (select (select (store .cse88 v_prenex_23 .cse84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse86 (select (select (store (store .cse87 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse88 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse85 1) (= .cse85 0) (= .cse86 1) (= .cse86 0) (not (= (select .cse3 v_prenex_23) 0))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_28 Int)) (or (forall ((v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse94 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse91 (store .cse94 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse92 (store .cse91 v_arrayElimCell_16 v_prenex_29)) (.cse93 (store v_prenex_27 8 2))) (let ((.cse89 (select (select (store .cse92 v_prenex_28 .cse93) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse90 (store .cse94 v_arrayElimCell_15 v_prenex_29))) (or (= .cse89 0) (= (select (select (store .cse90 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse89 1) (= (select (select (store (store .cse91 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse92 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse90 v_prenex_28 .cse93) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))))) (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_28) 0)))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse95 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_15) (not (= 2 (select v_arrayElimArr_7 8))) (not (= (select |c_#valid| v_prenex_25) 0)) (= 0 .cse95) (= 1 .cse95)))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_326 Int)) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse98 (store .cse97 v_arrayElimCell_15 v_prenex_32))) (let ((.cse96 (select (select (store .cse98 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse96 0) (= .cse96 1) (= (select (select (store (store .cse97 v_prenex_31 v_prenex_30) v_arrayElimCell_15 (store (select (store .cse98 v_prenex_31 v_prenex_30) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_31) 0))))))))) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_17 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_6 8))) (forall ((v_arrayElimCell_16 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse101 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse100 (select (select (store (store .cse101 v_arrayElimCell_15 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse99 (select (select (store (store (store .cse101 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse99 0) (= .cse100 1) (= .cse100 0) (= .cse99 1))))))))))) (or .cse8 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse102 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select .cse3 v_arrayElimCell_16) 0)) (not (= (select v_arrayElimArr_10 12) 2)) (= .cse102 1) (= .cse102 0))))) (or .cse8 (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse105 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse106 (store .cse105 v_arrayElimCell_16 v_prenex_24))) (let ((.cse103 (select (select (store .cse106 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse104 (select (select (store (store .cse105 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse106 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse103 1) (= .cse103 0) (= .cse104 1) (= .cse104 0) (not (= (select .cse3 v_prenex_23) 0)))))))) (or .cse8 (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse108 (store v_prenex_27 8 2)) (.cse107 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_29)) (.cse109 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29))) (or (= (select (select (store .cse107 v_prenex_28 .cse108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse109 v_prenex_28 .cse108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse107 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_28 v_prenex_27) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse109 v_prenex_28 v_prenex_27) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (not (= (select .cse3 v_prenex_28) 0)))))) (or .cse8 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse110 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= v_prenex_25 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_prenex_25) 0)) (= .cse110 0) (= .cse110 1))))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse112 (store v_prenex_27 8 2)) (.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse111 (store .cse114 v_arrayElimCell_16 v_prenex_29)) (.cse113 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse112) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store .cse111 v_prenex_28 .cse112) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse113 0) (= (select (select (store (store .cse114 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse111 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse111 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse113 1) (not (= (select .cse3 v_prenex_28) 0)))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_15) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_326 Int)) (let ((.cse118 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse119 (store v_prenex_19 8 2)) (.cse120 (store .cse118 v_arrayElimCell_15 v_prenex_21))) (let ((.cse116 (select (select (store (store .cse118 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse120 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse115 (select (select (store .cse120 v_prenex_20 .cse119) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse115 0) (= .cse116 0) (= .cse116 1) (= .cse115 1) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse117 (select (select (store (store (store .cse118 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse119) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse117 0) (= .cse117 1))))))))))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse122 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse123 (select (select (store (store .cse122 v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse121 (select (select (store (store (store .cse122 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse121 0) (= .cse121 1)))) (= 0 .cse123) (= 1 .cse123))))) (not (= 2 (select v_arrayElimArr_7 8))))) (= v_prenex_25 v_arrayElimCell_16))) (= v_prenex_25 v_arrayElimCell_15) (not (= (select |c_#valid| v_prenex_25) 0)))) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse127 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse128 (store .cse127 v_arrayElimCell_16 v_prenex_24)) (.cse125 (store v_prenex_22 8 2))) (let ((.cse124 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24)) (.cse126 (select (select (store .cse128 v_prenex_23 .cse125) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store .cse124 v_prenex_23 .cse125) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse124 v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse126 1) (= .cse126 0) (= (select (select (store (store .cse127 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse128 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_23) 0))))))) .cse8) (or .cse8 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse130 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse129 (select (select (store .cse130 v_arrayElimCell_16 v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse129 1) (not (= (store (store v_arrayElimArr_9 12 (select v_arrayElimArr_8 12)) 8 2) v_arrayElimArr_8)) (not (= (select .cse3 v_arrayElimCell_16) 0)) (not (= (select v_arrayElimArr_9 12) 2)) (= .cse129 0) (= (select (select (store .cse130 v_arrayElimCell_16 v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1)))))) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_15) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse134 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse135 (store v_prenex_19 8 2)) (.cse136 (store .cse134 v_arrayElimCell_15 v_prenex_21))) (let ((.cse132 (select (select (store (store .cse134 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse136 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse131 (select (select (store .cse136 v_prenex_20 .cse135) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse131 0) (= .cse132 0) (= .cse132 1) (= .cse131 1) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse133 (select (select (store (store (store .cse134 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse135) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse133 0) (= .cse133 1))))))))) (= v_prenex_20 v_arrayElimCell_16))))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse138 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse139 (store .cse138 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse137 (select (select (store .cse139 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse137 0) (= (select (select (store (store .cse138 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse139 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse137 1)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse142 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse143 (store .cse142 v_arrayElimCell_16 v_ArrVal_338)) (.cse140 (store v_ArrVal_337 8 2))) (let ((.cse141 (select (select (store .cse143 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse140) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse140) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse141 0) (= (select (select (store (store .cse142 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse143 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse141 1)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse146 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse147 (store .cse146 v_arrayElimCell_16 v_ArrVal_338)) (.cse148 (store v_ArrVal_337 8 2))) (let ((.cse144 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse148) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse145 (select (select (store .cse147 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse148) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse144 0) (= .cse145 0) (= (select (select (store (store .cse146 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse147 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse144 1) (= .cse145 1)))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16)))))) .cse8) (or .cse8 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_16 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse149 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select .cse3 v_prenex_17) 0)) (= .cse149 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse149 1))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse152 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse153 (store .cse152 v_arrayElimCell_15 v_prenex_24))) (let ((.cse150 (select (select (store .cse153 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse151 (select (select (store (store .cse152 v_prenex_23 v_prenex_22) v_arrayElimCell_15 (store (select (store .cse153 v_prenex_23 v_prenex_22) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_23) 0)) (= .cse150 1) (= .cse150 0) (= .cse151 0) (= .cse151 1)))))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse159 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse156 (store .cse159 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse157 (store .cse156 v_arrayElimCell_16 v_ArrVal_338)) (.cse158 (store v_ArrVal_337 8 2))) (let ((.cse155 (select (select (store (store .cse159 v_arrayElimCell_15 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse158) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse154 (select (select (store .cse157 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse158) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse154 1) (= .cse155 0) (= .cse155 1) (= .cse154 0) (= (select (select (store (store .cse156 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse157 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15))))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse165 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse162 (store .cse165 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse163 (store .cse162 v_arrayElimCell_16 v_ArrVal_338)) (.cse164 (store v_ArrVal_337 8 2))) (let ((.cse161 (select (select (store (store .cse165 v_arrayElimCell_15 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse164) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse160 (select (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse164) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse160 1) (= .cse161 0) (= .cse161 1) (= .cse160 0) (= (select (select (store (store .cse162 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15))))) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse169 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse170 (store .cse169 v_arrayElimCell_16 v_prenex_24)) (.cse171 (store v_prenex_22 8 2))) (let ((.cse167 (select (select (store .cse170 v_prenex_23 .cse171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse166 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse168 (select (select (store (store .cse169 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse170 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse166 0) (= .cse167 1) (= .cse167 0) (= .cse168 1) (= .cse166 1) (= .cse168 0) (not (= (select .cse3 v_prenex_23) 0))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse172 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_15 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse172 1) (= .cse172 0)))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse175 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse176 (store .cse175 v_arrayElimCell_16 v_prenex_32)) (.cse177 (store v_prenex_30 8 2))) (let ((.cse173 (select (select (store .cse176 v_prenex_31 .cse177) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse174 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse177) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse173 0) (= .cse174 0) (not (= (select .cse3 v_prenex_31) 0)) (= .cse173 1) (= .cse174 1) (= (select (select (store (store .cse175 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse176 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_31 Int)) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse180 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse181 (store .cse180 v_arrayElimCell_15 v_prenex_32)) (.cse182 (store v_prenex_30 8 2))) (let ((.cse178 (select (select (store .cse181 v_prenex_31 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse179 (select (select (store (store (store .cse180 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_32) v_prenex_31 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse178 0) (= .cse178 1) (= .cse179 1) (= .cse179 0) (= (select (select (store (store .cse180 v_prenex_31 v_prenex_30) v_arrayElimCell_15 (store (select (store .cse181 v_prenex_31 v_prenex_30) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_31) 0)))) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or .cse8 (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse185 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse186 (store .cse185 v_arrayElimCell_16 v_prenex_32)) (.cse184 (store v_prenex_30 8 2))) (let ((.cse183 (select (select (store .cse186 v_prenex_31 .cse184) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse183 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse184) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_31) 0)) (= .cse183 1) (= (select (select (store (store .cse185 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse186 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 Int) (v_ArrVal_326 Int)) (let ((.cse190 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse189 (store .cse190 v_arrayElimCell_15 v_prenex_21))) (let ((.cse188 (select (select (store (store .cse190 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse189 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse187 (select (select (store .cse189 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse187 0) (= v_prenex_20 v_arrayElimCell_15) (= .cse188 0) (= .cse188 1) (= .cse187 1)))))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or .cse8 (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse192 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse193 (store .cse192 v_arrayElimCell_16 v_prenex_32))) (let ((.cse191 (select (select (store .cse193 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse191 0) (not (= (select .cse3 v_prenex_31) 0)) (= .cse191 1) (= (select (select (store (store .cse192 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse193 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))))) is different from true [2025-02-07 20:07:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-07 20:07:47,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499937421] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:07:47,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:07:47,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 13 [2025-02-07 20:07:47,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182168969] [2025-02-07 20:07:47,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:07:47,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 20:07:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:47,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 20:07:47,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2025-02-07 20:07:47,438 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 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-02-07 20:07:51,525 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0))) (.cse3 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= 2 (select v_arrayElimArr_7 8))) (= 0 .cse0) (= 1 .cse0)))) (= v_prenex_25 v_arrayElimCell_15) (not (= (select |c_#valid| v_prenex_25) 0)))))) (or (and (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse3 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse4 0) (= .cse4 1)))))) (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse3 v_prenex_25))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_7 8))) (forall ((v_prenex_26 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse5 0) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse6 0) (= .cse6 1)))) (= .cse5 1)))))) (= v_prenex_25 v_arrayElimCell_16))))) (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse3 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse7 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse7 0) (= .cse7 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_28 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse9 (store .cse10 v_arrayElimCell_15 v_prenex_29))) (let ((.cse11 (select (select (store .cse9 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_28) 0)) (= (select (select (store .cse9 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse10 v_prenex_28 v_prenex_27) v_arrayElimCell_15 (store (select (store .cse9 v_prenex_28 v_prenex_27) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse11 0) (= .cse11 1)))))))) (or .cse8 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse14 (store .cse15 v_arrayElimCell_16 v_prenex_21))) (let ((.cse13 (select (select (store (store .cse15 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse14 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse12 (select (select (store .cse14 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse12 0) (= v_prenex_20 v_arrayElimCell_16) (= .cse13 1) (= .cse13 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse12 1))))))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse18 (store .cse17 v_arrayElimCell_15 v_ArrVal_338))) (let ((.cse16 (select (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse16 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse16 1) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15 (store (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15)))))))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_25 Int)) (or (= v_prenex_25 v_arrayElimCell_15) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse21 (select (select (store (store .cse20 v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse19 (select (select (store (store (store .cse20 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse19 0) (= .cse19 1)))) (= 0 .cse21) (= 1 .cse21))))) (not (= 2 (select v_arrayElimArr_7 8))))) (not (= (select |c_#valid| v_prenex_25) 0)))))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse23 (store v_prenex_27 8 2)) (.cse22 (store .cse24 v_arrayElimCell_16 v_prenex_29))) (or (= (select (select (store .cse22 v_prenex_28 .cse23) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse23) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse24 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse22 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse22 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_28) 0)))))) .cse8) (or .cse8 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse29 (store .cse28 v_arrayElimCell_16 v_prenex_21)) (.cse27 (store v_prenex_19 8 2))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse25 (select (select (store .cse29 v_prenex_20 .cse27) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse25 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse26 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse26 v_prenex_20 .cse27) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse28 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse29 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse25 1))))))) (or .cse8 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_16 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse30 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select .cse3 v_prenex_17) 0)) (= .cse30 0) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse30 1))))) (or .cse8 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse31 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= v_prenex_25 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_prenex_25) 0)) (= .cse31 0) (= .cse31 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))) (or .cse8 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse34 (store .cse33 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse32 (select (select (store .cse34 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse32 0) (= (select (select (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse34 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse32 1))))))) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse38 (store .cse37 v_arrayElimCell_16 v_ArrVal_338)) (.cse35 (store v_ArrVal_337 8 2))) (let ((.cse36 (select (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse35) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse35) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse36 0) (= (select (select (store (store .cse37 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse36 1)))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_23 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_23) 0)) (forall ((v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse41 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse43 (store .cse41 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse42 (store .cse41 v_arrayElimCell_15 v_prenex_24)) (.cse44 (store .cse43 v_arrayElimCell_16 v_prenex_24)) (.cse45 (store v_prenex_22 8 2))) (let ((.cse39 (select (select (store .cse44 v_prenex_23 .cse45) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse40 (select (select (store .cse42 v_prenex_23 .cse45) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse39 1) (= .cse40 1) (= .cse39 0) (= .cse40 0) (= (select (select (store (store .cse41 v_prenex_23 v_prenex_22) v_arrayElimCell_15 (store (select (store .cse42 v_prenex_23 v_prenex_22) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse43 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse44 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))))))))) (or (and (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse47 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse48 (store .cse47 v_arrayElimCell_16 v_prenex_21))) (let ((.cse46 (select (select (store .cse48 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse46 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store (store .cse47 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse48 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse46 1)))))) (not (= (select .cse3 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (not (= (select .cse3 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse52 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse51 (store .cse52 v_arrayElimCell_16 v_prenex_21))) (let ((.cse50 (select (select (store (store .cse52 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse51 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse49 (select (select (store .cse51 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse49 0) (= v_prenex_20 v_arrayElimCell_16) (= .cse50 1) (= .cse50 0) (= .cse49 1)))))))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int))) (let ((.cse57 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse56 (store v_prenex_19 8 2))) (let ((.cse54 (select (select (store .cse57 v_prenex_20 .cse56) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse53 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse57 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse53 0) (= .cse54 0) (= .cse54 1) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse55 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse56) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse55 0) (= .cse55 1)))) (= .cse53 1))))) (= v_prenex_20 v_arrayElimCell_16))) (not (= (select .cse3 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse61 (store v_prenex_19 8 2))) (let ((.cse58 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse59 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse60 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse58 0) (= .cse59 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse60 v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse58 1) (= .cse59 1))))) (not (= (select .cse3 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (not (= (select .cse3 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse65 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse66 (store .cse65 v_arrayElimCell_16 v_prenex_21)) (.cse64 (store v_prenex_19 8 2))) (let ((.cse63 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse62 (select (select (store .cse66 v_prenex_20 .cse64) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse62 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse63 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse63 v_prenex_20 .cse64) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse65 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse66 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse62 1))))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse68 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse69 (store .cse68 v_arrayElimCell_15 v_ArrVal_338))) (let ((.cse67 (select (select (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse67 0) (= .cse67 1) (= (select (select (store (store .cse68 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15 (store (select (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or .cse8 (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse71 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse72 (store .cse71 v_arrayElimCell_16 v_prenex_29))) (let ((.cse70 (select (select (store .cse72 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse70 1) (= .cse70 0) (= (select (select (store (store .cse71 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse72 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse72 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_28) 0)))))))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse74 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse75 (store .cse74 v_arrayElimCell_16 v_prenex_21))) (let ((.cse73 (select (select (store .cse75 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse73 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store (store .cse74 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse75 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse73 1)))))) .cse8) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse79 (store v_prenex_19 8 2))) (let ((.cse76 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse77 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse78 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse76 0) (= .cse77 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse78 v_prenex_20 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse76 1) (= .cse77 1))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_15) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse83 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse82 (store .cse83 v_arrayElimCell_15 v_prenex_21))) (let ((.cse81 (select (select (store (store .cse83 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse82 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse80 (select (select (store .cse82 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse80 0) (= .cse81 0) (= .cse81 1) (= .cse80 1)))))))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse88 (store .cse87 v_arrayElimCell_16 v_prenex_24)) (.cse84 (store v_prenex_22 8 2))) (let ((.cse85 (select (select (store .cse88 v_prenex_23 .cse84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse86 (select (select (store (store .cse87 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse88 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse85 1) (= .cse85 0) (= .cse86 1) (= .cse86 0) (not (= (select .cse3 v_prenex_23) 0))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_28 Int)) (or (forall ((v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse94 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse91 (store .cse94 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse92 (store .cse91 v_arrayElimCell_16 v_prenex_29)) (.cse93 (store v_prenex_27 8 2))) (let ((.cse89 (select (select (store .cse92 v_prenex_28 .cse93) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse90 (store .cse94 v_arrayElimCell_15 v_prenex_29))) (or (= .cse89 0) (= (select (select (store .cse90 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse89 1) (= (select (select (store (store .cse91 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse92 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse90 v_prenex_28 .cse93) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))))) (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_28) 0)))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse95 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_15) (not (= 2 (select v_arrayElimArr_7 8))) (not (= (select |c_#valid| v_prenex_25) 0)) (= 0 .cse95) (= 1 .cse95)))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_326 Int)) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse98 (store .cse97 v_arrayElimCell_15 v_prenex_32))) (let ((.cse96 (select (select (store .cse98 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse96 0) (= .cse96 1) (= (select (select (store (store .cse97 v_prenex_31 v_prenex_30) v_arrayElimCell_15 (store (select (store .cse98 v_prenex_31 v_prenex_30) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_31) 0))))))))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_17 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_6 8))) (forall ((v_arrayElimCell_16 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse101 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse100 (select (select (store (store .cse101 v_arrayElimCell_15 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse99 (select (select (store (store (store .cse101 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse99 0) (= .cse100 1) (= .cse100 0) (= .cse99 1))))))))))) (or .cse8 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse102 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select .cse3 v_arrayElimCell_16) 0)) (not (= (select v_arrayElimArr_10 12) 2)) (= .cse102 1) (= .cse102 0))))) (or .cse8 (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse105 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse106 (store .cse105 v_arrayElimCell_16 v_prenex_24))) (let ((.cse103 (select (select (store .cse106 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse104 (select (select (store (store .cse105 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse106 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse103 1) (= .cse103 0) (= .cse104 1) (= .cse104 0) (not (= (select .cse3 v_prenex_23) 0)))))))) (or .cse8 (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse108 (store v_prenex_27 8 2)) (.cse107 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_29)) (.cse109 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29))) (or (= (select (select (store .cse107 v_prenex_28 .cse108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse109 v_prenex_28 .cse108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse107 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_28 v_prenex_27) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse109 v_prenex_28 v_prenex_27) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (not (= (select .cse3 v_prenex_28) 0)))))) (or .cse8 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse110 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= v_prenex_25 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_prenex_25) 0)) (= .cse110 0) (= .cse110 1))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse112 (store v_prenex_27 8 2)) (.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse111 (store .cse114 v_arrayElimCell_16 v_prenex_29)) (.cse113 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse112) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store .cse111 v_prenex_28 .cse112) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse113 0) (= (select (select (store (store .cse114 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse111 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse111 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse113 1) (not (= (select .cse3 v_prenex_28) 0)))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_15) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_326 Int)) (let ((.cse118 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse119 (store v_prenex_19 8 2)) (.cse120 (store .cse118 v_arrayElimCell_15 v_prenex_21))) (let ((.cse116 (select (select (store (store .cse118 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse120 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse115 (select (select (store .cse120 v_prenex_20 .cse119) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse115 0) (= .cse116 0) (= .cse116 1) (= .cse115 1) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse117 (select (select (store (store (store .cse118 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse119) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse117 0) (= .cse117 1))))))))))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse122 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse123 (select (select (store (store .cse122 v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse121 (select (select (store (store (store .cse122 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse121 0) (= .cse121 1)))) (= 0 .cse123) (= 1 .cse123))))) (not (= 2 (select v_arrayElimArr_7 8))))) (= v_prenex_25 v_arrayElimCell_16))) (= v_prenex_25 v_arrayElimCell_15) (not (= (select |c_#valid| v_prenex_25) 0)))) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse127 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse128 (store .cse127 v_arrayElimCell_16 v_prenex_24)) (.cse125 (store v_prenex_22 8 2))) (let ((.cse124 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24)) (.cse126 (select (select (store .cse128 v_prenex_23 .cse125) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store .cse124 v_prenex_23 .cse125) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse124 v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse126 1) (= .cse126 0) (= (select (select (store (store .cse127 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse128 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_23) 0))))))) .cse8) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (or .cse8 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse130 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse129 (select (select (store .cse130 v_arrayElimCell_16 v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse129 1) (not (= (store (store v_arrayElimArr_9 12 (select v_arrayElimArr_8 12)) 8 2) v_arrayElimArr_8)) (not (= (select .cse3 v_arrayElimCell_16) 0)) (not (= (select v_arrayElimArr_9 12) 2)) (= .cse129 0) (= (select (select (store .cse130 v_arrayElimCell_16 v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1)))))) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_15) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse134 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse135 (store v_prenex_19 8 2)) (.cse136 (store .cse134 v_arrayElimCell_15 v_prenex_21))) (let ((.cse132 (select (select (store (store .cse134 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse136 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse131 (select (select (store .cse136 v_prenex_20 .cse135) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse131 0) (= .cse132 0) (= .cse132 1) (= .cse131 1) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse133 (select (select (store (store (store .cse134 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse135) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse133 0) (= .cse133 1))))))))) (= v_prenex_20 v_arrayElimCell_16))))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse138 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse139 (store .cse138 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse137 (select (select (store .cse139 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse137 0) (= (select (select (store (store .cse138 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse139 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse137 1)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse142 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse143 (store .cse142 v_arrayElimCell_16 v_ArrVal_338)) (.cse140 (store v_ArrVal_337 8 2))) (let ((.cse141 (select (select (store .cse143 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse140) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse140) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse141 0) (= (select (select (store (store .cse142 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse143 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse141 1)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse146 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse147 (store .cse146 v_arrayElimCell_16 v_ArrVal_338)) (.cse148 (store v_ArrVal_337 8 2))) (let ((.cse144 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse148) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse145 (select (select (store .cse147 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse148) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse144 0) (= .cse145 0) (= (select (select (store (store .cse146 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse147 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse144 1) (= .cse145 1)))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16)))))) .cse8) (or .cse8 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_16 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse149 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select .cse3 v_prenex_17) 0)) (= .cse149 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse149 1))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse152 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse153 (store .cse152 v_arrayElimCell_15 v_prenex_24))) (let ((.cse150 (select (select (store .cse153 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse151 (select (select (store (store .cse152 v_prenex_23 v_prenex_22) v_arrayElimCell_15 (store (select (store .cse153 v_prenex_23 v_prenex_22) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_23) 0)) (= .cse150 1) (= .cse150 0) (= .cse151 0) (= .cse151 1)))))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse159 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse156 (store .cse159 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse157 (store .cse156 v_arrayElimCell_16 v_ArrVal_338)) (.cse158 (store v_ArrVal_337 8 2))) (let ((.cse155 (select (select (store (store .cse159 v_arrayElimCell_15 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse158) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse154 (select (select (store .cse157 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse158) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse154 1) (= .cse155 0) (= .cse155 1) (= .cse154 0) (= (select (select (store (store .cse156 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse157 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15))))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse165 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse162 (store .cse165 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse163 (store .cse162 v_arrayElimCell_16 v_ArrVal_338)) (.cse164 (store v_ArrVal_337 8 2))) (let ((.cse161 (select (select (store (store .cse165 v_arrayElimCell_15 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse164) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse160 (select (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse164) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse160 1) (= .cse161 0) (= .cse161 1) (= .cse160 0) (= (select (select (store (store .cse162 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15))))) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse169 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse170 (store .cse169 v_arrayElimCell_16 v_prenex_24)) (.cse171 (store v_prenex_22 8 2))) (let ((.cse167 (select (select (store .cse170 v_prenex_23 .cse171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse166 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse168 (select (select (store (store .cse169 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse170 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse166 0) (= .cse167 1) (= .cse167 0) (= .cse168 1) (= .cse166 1) (= .cse168 0) (not (= (select .cse3 v_prenex_23) 0))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse172 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_15 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse172 1) (= .cse172 0)))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse175 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse176 (store .cse175 v_arrayElimCell_16 v_prenex_32)) (.cse177 (store v_prenex_30 8 2))) (let ((.cse173 (select (select (store .cse176 v_prenex_31 .cse177) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse174 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse177) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse173 0) (= .cse174 0) (not (= (select .cse3 v_prenex_31) 0)) (= .cse173 1) (= .cse174 1) (= (select (select (store (store .cse175 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse176 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_31 Int)) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse180 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse181 (store .cse180 v_arrayElimCell_15 v_prenex_32)) (.cse182 (store v_prenex_30 8 2))) (let ((.cse178 (select (select (store .cse181 v_prenex_31 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse179 (select (select (store (store (store .cse180 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_32) v_prenex_31 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse178 0) (= .cse178 1) (= .cse179 1) (= .cse179 0) (= (select (select (store (store .cse180 v_prenex_31 v_prenex_30) v_arrayElimCell_15 (store (select (store .cse181 v_prenex_31 v_prenex_30) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_31) 0)))) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or .cse8 (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse185 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse186 (store .cse185 v_arrayElimCell_16 v_prenex_32)) (.cse184 (store v_prenex_30 8 2))) (let ((.cse183 (select (select (store .cse186 v_prenex_31 .cse184) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse183 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse184) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_31) 0)) (= .cse183 1) (= (select (select (store (store .cse185 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse186 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 Int) (v_ArrVal_326 Int)) (let ((.cse190 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse189 (store .cse190 v_arrayElimCell_15 v_prenex_21))) (let ((.cse188 (select (select (store (store .cse190 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse189 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse187 (select (select (store .cse189 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse187 0) (= v_prenex_20 v_arrayElimCell_15) (= .cse188 0) (= .cse188 1) (= .cse187 1)))))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (= (select .cse1 8) 0) (or .cse8 (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse192 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse193 (store .cse192 v_arrayElimCell_16 v_prenex_32))) (let ((.cse191 (select (select (store .cse193 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse191 0) (not (= (select .cse3 v_prenex_31) 0)) (= .cse191 1) (= (select (select (store (store .cse192 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse193 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))))) is different from true [2025-02-07 20:07:55,596 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse8 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0))) (.cse3 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= 2 (select v_arrayElimArr_7 8))) (= 0 .cse0) (= 1 .cse0)))) (= v_prenex_25 v_arrayElimCell_15) (not (= (select |c_#valid| v_prenex_25) 0)))))) (or (and (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse3 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse4 0) (= .cse4 1)))))) (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse3 v_prenex_25))) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_7 8))) (forall ((v_prenex_26 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse5 0) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse6 0) (= .cse6 1)))) (= .cse5 1)))))) (= v_prenex_25 v_arrayElimCell_16))))) (forall ((v_prenex_25 Int)) (or (not (= 0 (select .cse3 v_prenex_25))) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse7 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= .cse7 0) (= .cse7 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_28 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse9 (store .cse10 v_arrayElimCell_15 v_prenex_29))) (let ((.cse11 (select (select (store .cse9 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_28) 0)) (= (select (select (store .cse9 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse10 v_prenex_28 v_prenex_27) v_arrayElimCell_15 (store (select (store .cse9 v_prenex_28 v_prenex_27) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse11 0) (= .cse11 1)))))))) (or .cse8 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse14 (store .cse15 v_arrayElimCell_16 v_prenex_21))) (let ((.cse13 (select (select (store (store .cse15 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse14 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse12 (select (select (store .cse14 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse12 0) (= v_prenex_20 v_arrayElimCell_16) (= .cse13 1) (= .cse13 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse12 1))))))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse18 (store .cse17 v_arrayElimCell_15 v_ArrVal_338))) (let ((.cse16 (select (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse16 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse16 1) (= (select (select (store (store .cse17 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15 (store (select (store .cse18 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15)))))))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_25 Int)) (or (= v_prenex_25 v_arrayElimCell_15) (forall ((v_arrayElimArr_7 (Array Int Int)) (v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse21 (select (select (store (store .cse20 v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse19 (select (select (store (store (store .cse20 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse19 0) (= .cse19 1)))) (= 0 .cse21) (= 1 .cse21))))) (not (= 2 (select v_arrayElimArr_7 8))))) (not (= (select |c_#valid| v_prenex_25) 0)))))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse23 (store v_prenex_27 8 2)) (.cse22 (store .cse24 v_arrayElimCell_16 v_prenex_29))) (or (= (select (select (store .cse22 v_prenex_28 .cse23) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse23) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse24 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse22 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse22 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_28) 0)))))) .cse8) (or .cse8 (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse29 (store .cse28 v_arrayElimCell_16 v_prenex_21)) (.cse27 (store v_prenex_19 8 2))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse25 (select (select (store .cse29 v_prenex_20 .cse27) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse25 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse26 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse26 v_prenex_20 .cse27) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse28 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse29 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse25 1))))))) (or .cse8 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_16 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse30 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select .cse3 v_prenex_17) 0)) (= .cse30 0) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse30 1))))) (or .cse8 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse31 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= v_prenex_25 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_prenex_25) 0)) (= .cse31 0) (= .cse31 1) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))) (or .cse8 (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse34 (store .cse33 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse32 (select (select (store .cse34 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= .cse32 0) (= (select (select (store (store .cse33 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse34 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse32 1))))))) (or (forall ((v_ArrVal_337 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse37 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse38 (store .cse37 v_arrayElimCell_16 v_ArrVal_338)) (.cse35 (store v_ArrVal_337 8 2))) (let ((.cse36 (select (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse35) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse35) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse36 0) (= (select (select (store (store .cse37 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse38 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse36 1)))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_23 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_23) 0)) (forall ((v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse41 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse43 (store .cse41 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse42 (store .cse41 v_arrayElimCell_15 v_prenex_24)) (.cse44 (store .cse43 v_arrayElimCell_16 v_prenex_24)) (.cse45 (store v_prenex_22 8 2))) (let ((.cse39 (select (select (store .cse44 v_prenex_23 .cse45) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse40 (select (select (store .cse42 v_prenex_23 .cse45) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse39 1) (= .cse40 1) (= .cse39 0) (= .cse40 0) (= (select (select (store (store .cse41 v_prenex_23 v_prenex_22) v_arrayElimCell_15 (store (select (store .cse42 v_prenex_23 v_prenex_22) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse43 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse44 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))))))))) (or (and (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse47 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse48 (store .cse47 v_arrayElimCell_16 v_prenex_21))) (let ((.cse46 (select (select (store .cse48 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse46 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store (store .cse47 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse48 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse46 1)))))) (not (= (select .cse3 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (not (= (select .cse3 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse52 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse51 (store .cse52 v_arrayElimCell_16 v_prenex_21))) (let ((.cse50 (select (select (store (store .cse52 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse51 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse49 (select (select (store .cse51 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse49 0) (= v_prenex_20 v_arrayElimCell_16) (= .cse50 1) (= .cse50 0) (= .cse49 1)))))))) (forall ((v_prenex_20 Int)) (or (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int))) (let ((.cse57 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse56 (store v_prenex_19 8 2))) (let ((.cse54 (select (select (store .cse57 v_prenex_20 .cse56) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse53 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse57 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse53 0) (= .cse54 0) (= .cse54 1) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse55 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse56) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse55 0) (= .cse55 1)))) (= .cse53 1))))) (= v_prenex_20 v_arrayElimCell_16))) (not (= (select .cse3 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse61 (store v_prenex_19 8 2))) (let ((.cse58 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse59 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse60 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse58 0) (= .cse59 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse60 v_prenex_20 .cse61) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse58 1) (= .cse59 1))))) (not (= (select .cse3 v_prenex_20) 0)))) (forall ((v_prenex_20 Int)) (or (not (= (select .cse3 v_prenex_20) 0)) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse65 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse66 (store .cse65 v_arrayElimCell_16 v_prenex_21)) (.cse64 (store v_prenex_19 8 2))) (let ((.cse63 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse62 (select (select (store .cse66 v_prenex_20 .cse64) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse62 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse63 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse63 v_prenex_20 .cse64) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store .cse65 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse66 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse62 1))))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse68 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse69 (store .cse68 v_arrayElimCell_15 v_ArrVal_338))) (let ((.cse67 (select (select (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse67 0) (= .cse67 1) (= (select (select (store (store .cse68 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15 (store (select (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or .cse8 (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse71 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse72 (store .cse71 v_arrayElimCell_16 v_prenex_29))) (let ((.cse70 (select (select (store .cse72 v_prenex_28 (store v_prenex_27 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse70 1) (= .cse70 0) (= (select (select (store (store .cse71 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse72 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse72 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_28) 0)))))))) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse74 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse75 (store .cse74 v_arrayElimCell_16 v_prenex_21))) (let ((.cse73 (select (select (store .cse75 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse73 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21) v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store (store .cse74 v_prenex_20 v_prenex_19) v_arrayElimCell_16 (store (select (store .cse75 v_prenex_20 v_prenex_19) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse73 1)))))) .cse8) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_20 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse78 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_21)) (.cse79 (store v_prenex_19 8 2))) (let ((.cse76 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse77 (select (select (store (store |c_#memory_int#1| v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse78 v_prenex_20 v_prenex_19) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse76 0) (= .cse77 0) (= v_prenex_20 v_arrayElimCell_16) (= (select (select (store .cse78 v_prenex_20 .cse79) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= v_prenex_20 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse76 1) (= .cse77 1))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_15) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse83 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse82 (store .cse83 v_arrayElimCell_15 v_prenex_21))) (let ((.cse81 (select (select (store (store .cse83 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse82 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse80 (select (select (store .cse82 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse80 0) (= .cse81 0) (= .cse81 1) (= .cse80 1)))))))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse88 (store .cse87 v_arrayElimCell_16 v_prenex_24)) (.cse84 (store v_prenex_22 8 2))) (let ((.cse85 (select (select (store .cse88 v_prenex_23 .cse84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse86 (select (select (store (store .cse87 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse88 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse84) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse85 1) (= .cse85 0) (= .cse86 1) (= .cse86 0) (not (= (select .cse3 v_prenex_23) 0))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_28 Int)) (or (forall ((v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int) (v_prenex_27 (Array Int Int))) (let ((.cse94 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse91 (store .cse94 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse92 (store .cse91 v_arrayElimCell_16 v_prenex_29)) (.cse93 (store v_prenex_27 8 2))) (let ((.cse89 (select (select (store .cse92 v_prenex_28 .cse93) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse90 (store .cse94 v_arrayElimCell_15 v_prenex_29))) (or (= .cse89 0) (= (select (select (store .cse90 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse89 1) (= (select (select (store (store .cse91 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse92 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse90 v_prenex_28 .cse93) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1))))))) (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_28) 0)))))) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse95 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_15) (not (= 2 (select v_arrayElimArr_7 8))) (not (= (select |c_#valid| v_prenex_25) 0)) (= 0 .cse95) (= 1 .cse95)))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_prenex_31 Int) (v_ArrVal_326 Int)) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse98 (store .cse97 v_arrayElimCell_15 v_prenex_32))) (let ((.cse96 (select (select (store .cse98 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse96 0) (= .cse96 1) (= (select (select (store (store .cse97 v_prenex_31 v_prenex_30) v_arrayElimCell_15 (store (select (store .cse98 v_prenex_31 v_prenex_30) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_31) 0))))))))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_17 Int)) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_17) 0)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= 2 (select v_arrayElimArr_6 8))) (forall ((v_arrayElimCell_16 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse101 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse100 (select (select (store (store .cse101 v_arrayElimCell_15 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse99 (select (select (store (store (store .cse101 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse99 0) (= .cse100 1) (= .cse100 0) (= .cse99 1))))))))))) (or .cse8 (forall ((v_arrayElimArr_10 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse102 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_arrayElimArr_10) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select .cse3 v_arrayElimCell_16) 0)) (not (= (select v_arrayElimArr_10 12) 2)) (= .cse102 1) (= .cse102 0))))) (or .cse8 (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse105 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse106 (store .cse105 v_arrayElimCell_16 v_prenex_24))) (let ((.cse103 (select (select (store .cse106 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse104 (select (select (store (store .cse105 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse106 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse103 1) (= .cse103 0) (= .cse104 1) (= .cse104 0) (not (= (select .cse3 v_prenex_23) 0)))))))) (or .cse8 (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse108 (store v_prenex_27 8 2)) (.cse107 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_29)) (.cse109 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29))) (or (= (select (select (store .cse107 v_prenex_28 .cse108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse109 v_prenex_28 .cse108) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store .cse107 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_28 v_prenex_27) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse109 v_prenex_28 v_prenex_27) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (not (= (select .cse3 v_prenex_28) 0)))))) (or .cse8 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_prenex_25 Int) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_prenex_26 (Array Int Int))) (let ((.cse110 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= v_prenex_25 v_arrayElimCell_16) (not (= 2 (select v_arrayElimArr_7 8))) (= v_prenex_25 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_prenex_25) 0)) (= .cse110 0) (= .cse110 1))))) (or (forall ((v_prenex_28 Int) (v_arrayElimCell_16 Int) (v_prenex_29 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse112 (store v_prenex_27 8 2)) (.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse111 (store .cse114 v_arrayElimCell_16 v_prenex_29)) (.cse113 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_29) v_prenex_28 .cse112) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store .cse111 v_prenex_28 .cse112) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse113 0) (= (select (select (store (store .cse114 v_prenex_28 v_prenex_27) v_arrayElimCell_16 (store (select (store .cse111 v_prenex_28 v_prenex_27) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= (select (select (store .cse111 v_prenex_28 (store v_prenex_27 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse113 1) (not (= (select .cse3 v_prenex_28) 0)))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_15) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_326 Int)) (let ((.cse118 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse119 (store v_prenex_19 8 2)) (.cse120 (store .cse118 v_arrayElimCell_15 v_prenex_21))) (let ((.cse116 (select (select (store (store .cse118 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse120 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse115 (select (select (store .cse120 v_prenex_20 .cse119) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse115 0) (= .cse116 0) (= .cse116 1) (= .cse115 1) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse117 (select (select (store (store (store .cse118 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse119) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse117 0) (= .cse117 1))))))))))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_25 Int)) (or (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_326 Int) (v_prenex_26 (Array Int Int))) (let ((.cse122 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse123 (select (select (store (store .cse122 v_arrayElimCell_15 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse121 (select (select (store (store (store .cse122 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_26) v_prenex_25 v_arrayElimArr_7) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse121 0) (= .cse121 1)))) (= 0 .cse123) (= 1 .cse123))))) (not (= 2 (select v_arrayElimArr_7 8))))) (= v_prenex_25 v_arrayElimCell_16))) (= v_prenex_25 v_arrayElimCell_15) (not (= (select |c_#valid| v_prenex_25) 0)))) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse127 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse128 (store .cse127 v_arrayElimCell_16 v_prenex_24)) (.cse125 (store v_prenex_22 8 2))) (let ((.cse124 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24)) (.cse126 (select (select (store .cse128 v_prenex_23 .cse125) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store .cse124 v_prenex_23 .cse125) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= (select (select (store (store |c_#memory_int#1| v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base| (store (select (store .cse124 v_prenex_23 v_prenex_22) |c_ULTIMATE.start_main_~x~0#1.base|) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= .cse126 1) (= .cse126 0) (= (select (select (store (store .cse127 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse128 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_23) 0))))))) .cse8) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (or .cse8 (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse130 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse129 (select (select (store .cse130 v_arrayElimCell_16 v_arrayElimArr_9) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse129 1) (not (= (store (store v_arrayElimArr_9 12 (select v_arrayElimArr_8 12)) 8 2) v_arrayElimArr_8)) (not (= (select .cse3 v_arrayElimCell_16) 0)) (not (= (select v_arrayElimArr_9 12) 2)) (= .cse129 0) (= (select (select (store .cse130 v_arrayElimCell_16 v_arrayElimArr_8) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1)))))) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((v_prenex_20 Int)) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= v_prenex_20 v_arrayElimCell_15) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse134 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse135 (store v_prenex_19 8 2)) (.cse136 (store .cse134 v_arrayElimCell_15 v_prenex_21))) (let ((.cse132 (select (select (store (store .cse134 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse136 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse131 (select (select (store .cse136 v_prenex_20 .cse135) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse131 0) (= .cse132 0) (= .cse132 1) (= .cse131 1) (forall ((v_ArrVal_332 (Array Int Int))) (let ((.cse133 (select (select (store (store (store .cse134 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_21) v_prenex_20 .cse135) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse133 0) (= .cse133 1))))))))) (= v_prenex_20 v_arrayElimCell_16))))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse138 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse139 (store .cse138 v_arrayElimCell_16 v_ArrVal_338))) (let ((.cse137 (select (select (store .cse139 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| (store v_ArrVal_337 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse137 0) (= (select (select (store (store .cse138 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse139 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse137 1)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse142 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse143 (store .cse142 v_arrayElimCell_16 v_ArrVal_338)) (.cse140 (store v_ArrVal_337 8 2))) (let ((.cse141 (select (select (store .cse143 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse140) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse140) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse141 0) (= (select (select (store (store .cse142 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse143 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16) (= .cse141 1)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select .cse3 |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse146 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse147 (store .cse146 v_arrayElimCell_16 v_ArrVal_338)) (.cse148 (store v_ArrVal_337 8 2))) (let ((.cse144 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse148) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse145 (select (select (store .cse147 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse148) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse144 0) (= .cse145 0) (= (select (select (store (store .cse146 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse147 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse144 1) (= .cse145 1)))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16)))))) .cse8) (or .cse8 (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_arrayElimCell_16 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse149 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332) v_arrayElimCell_16 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select .cse3 v_prenex_17) 0)) (= .cse149 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse149 1))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse152 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse153 (store .cse152 v_arrayElimCell_15 v_prenex_24))) (let ((.cse150 (select (select (store .cse153 v_prenex_23 (store v_prenex_22 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse151 (select (select (store (store .cse152 v_prenex_23 v_prenex_22) v_arrayElimCell_15 (store (select (store .cse153 v_prenex_23 v_prenex_22) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_23) 0)) (= .cse150 1) (= .cse150 0) (= .cse151 0) (= .cse151 1)))))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (forall ((v_arrayElimCell_15 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_16 Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse159 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse156 (store .cse159 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse157 (store .cse156 v_arrayElimCell_16 v_ArrVal_338)) (.cse158 (store v_ArrVal_337 8 2))) (let ((.cse155 (select (select (store (store .cse159 v_arrayElimCell_15 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse158) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse154 (select (select (store .cse157 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse158) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse154 1) (= .cse155 0) (= .cse155 1) (= .cse154 0) (= (select (select (store (store .cse156 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse157 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_16))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15))))) (forall ((v_arrayElimCell_15 Int)) (or (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_12|) 0)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_338 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse165 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse162 (store .cse165 v_arrayElimCell_15 v_ArrVal_332))) (let ((.cse163 (store .cse162 v_arrayElimCell_16 v_ArrVal_338)) (.cse164 (store v_ArrVal_337 8 2))) (let ((.cse161 (select (select (store (store .cse165 v_arrayElimCell_15 v_ArrVal_338) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse164) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse160 (select (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| .cse164) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse160 1) (= .cse161 0) (= .cse161 1) (= .cse160 0) (= (select (select (store (store .cse162 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16 (store (select (store .cse163 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_337) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_15))))) (or (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (let ((.cse169 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse170 (store .cse169 v_arrayElimCell_16 v_prenex_24)) (.cse171 (store v_prenex_22 8 2))) (let ((.cse167 (select (select (store .cse170 v_prenex_23 .cse171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse166 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_24) v_prenex_23 .cse171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse168 (select (select (store (store .cse169 v_prenex_23 v_prenex_22) v_arrayElimCell_16 (store (select (store .cse170 v_prenex_23 v_prenex_22) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse166 0) (= .cse167 1) (= .cse167 0) (= .cse168 1) (= .cse166 1) (= .cse168 0) (not (= (select .cse3 v_prenex_23) 0))))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_prenex_17 Int) (v_prenex_18 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse172 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)) v_arrayElimCell_15 v_prenex_18) v_prenex_17 v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_17) 0)) (not (= 2 (select v_arrayElimArr_6 8))) (= .cse172 1) (= .cse172 0)))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse175 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse176 (store .cse175 v_arrayElimCell_16 v_prenex_32)) (.cse177 (store v_prenex_30 8 2))) (let ((.cse173 (select (select (store .cse176 v_prenex_31 .cse177) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse174 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse177) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse173 0) (= .cse174 0) (not (= (select .cse3 v_prenex_31) 0)) (= .cse173 1) (= .cse174 1) (= (select (select (store (store .cse175 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse176 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) .cse8) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_31 Int)) (or (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_ArrVal_332 (Array Int Int)) (v_ArrVal_326 Int)) (let ((.cse180 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse181 (store .cse180 v_arrayElimCell_15 v_prenex_32)) (.cse182 (store v_prenex_30 8 2))) (let ((.cse178 (select (select (store .cse181 v_prenex_31 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse179 (select (select (store (store (store .cse180 v_arrayElimCell_15 v_ArrVal_332) v_arrayElimCell_16 v_prenex_32) v_prenex_31 .cse182) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse178 0) (= .cse178 1) (= .cse179 1) (= .cse179 0) (= (select (select (store (store .cse180 v_prenex_31 v_prenex_30) v_arrayElimCell_15 (store (select (store .cse181 v_prenex_31 v_prenex_30) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0)))))) (not (= (select (store |c_#valid| v_arrayElimCell_15 1) v_prenex_31) 0)))) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or .cse8 (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse185 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse186 (store .cse185 v_arrayElimCell_16 v_prenex_32)) (.cse184 (store v_prenex_30 8 2))) (let ((.cse183 (select (select (store .cse186 v_prenex_31 .cse184) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse183 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_32) v_prenex_31 .cse184) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (not (= (select .cse3 v_prenex_31) 0)) (= .cse183 1) (= (select (select (store (store .cse185 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse186 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))) (forall ((v_arrayElimCell_15 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 Int) (v_ArrVal_326 Int)) (let ((.cse190 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_326)))) (let ((.cse189 (store .cse190 v_arrayElimCell_15 v_prenex_21))) (let ((.cse188 (select (select (store (store .cse190 v_prenex_20 v_prenex_19) v_arrayElimCell_15 (store (select (store .cse189 v_prenex_20 v_prenex_19) v_arrayElimCell_15) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse187 (select (select (store .cse189 v_prenex_20 (store v_prenex_19 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= (select |c_#valid| v_prenex_20) 0)) (= .cse187 0) (= v_prenex_20 v_arrayElimCell_15) (= .cse188 0) (= .cse188 1) (= .cse187 1)))))) (= v_arrayElimCell_15 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| v_arrayElimCell_15) 0)))) (or .cse8 (forall ((v_prenex_32 (Array Int Int)) (v_prenex_30 (Array Int Int)) (v_arrayElimCell_16 Int) (v_prenex_31 Int) (v_ArrVal_332 (Array Int Int))) (let ((.cse192 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_332))) (let ((.cse193 (store .cse192 v_arrayElimCell_16 v_prenex_32))) (let ((.cse191 (select (select (store .cse193 v_prenex_31 (store v_prenex_30 8 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse191 0) (not (= (select .cse3 v_prenex_31) 0)) (= .cse191 1) (= (select (select (store (store .cse192 v_prenex_31 v_prenex_30) v_arrayElimCell_16 (store (select (store .cse193 v_prenex_31 v_prenex_30) v_arrayElimCell_16) 12 2)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0))))))))) is different from true [2025-02-07 20:07:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:56,317 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2025-02-07 20:07:56,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 20:07:56,318 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 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) Word has length 17 [2025-02-07 20:07:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:56,318 INFO L225 Difference]: With dead ends: 80 [2025-02-07 20:07:56,318 INFO L226 Difference]: Without dead ends: 62 [2025-02-07 20:07:56,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=84, Invalid=197, Unknown=3, NotChecked=96, Total=380 [2025-02-07 20:07:56,319 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:56,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 172 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 105 Invalid, 0 Unknown, 84 Unchecked, 0.6s Time] [2025-02-07 20:07:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-07 20:07:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2025-02-07 20:07:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 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-02-07 20:07:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-02-07 20:07:56,328 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2025-02-07 20:07:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:56,328 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-02-07 20:07:56,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 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-02-07 20:07:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-02-07 20:07:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:07:56,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:56,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:56,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:07:56,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:56,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:07:56,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash 237765522, now seen corresponding path program 1 times [2025-02-07 20:07:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:56,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768684924] [2025-02-07 20:07:56,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:56,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:56,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:07:56,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:07:56,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:56,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:07:56,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:56,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768684924] [2025-02-07 20:07:56,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768684924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:56,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:56,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:07:56,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810108193] [2025-02-07 20:07:56,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:56,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:07:56,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:56,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:07:56,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:56,733 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-02-07 20:07:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:56,863 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2025-02-07 20:07:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:56,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 18 [2025-02-07 20:07:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:56,864 INFO L225 Difference]: With dead ends: 78 [2025-02-07 20:07:56,864 INFO L226 Difference]: Without dead ends: 52 [2025-02-07 20:07:56,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:07:56,864 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:56,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 98 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-07 20:07:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-07 20:07:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 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-02-07 20:07:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-02-07 20:07:56,881 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 18 [2025-02-07 20:07:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:56,881 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-02-07 20:07:56,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-02-07 20:07:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-02-07 20:07:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:07:56,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:56,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:56,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:07:56,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:07:56,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:56,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2058728493, now seen corresponding path program 1 times [2025-02-07 20:07:56,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:56,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852425237] [2025-02-07 20:07:56,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:56,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:56,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:07:56,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:07:56,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:56,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:56,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852425237] [2025-02-07 20:07:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852425237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:07:56,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:07:56,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:07:56,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518203155] [2025-02-07 20:07:56,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:07:56,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:07:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:07:56,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:07:56,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:07:56,952 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:07:57,025 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2025-02-07 20:07:57,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:07:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 20:07:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:07:57,025 INFO L225 Difference]: With dead ends: 52 [2025-02-07 20:07:57,025 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 20:07:57,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:07:57,026 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:07:57,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:07:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 20:07:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-07 20:07:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 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-02-07 20:07:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-02-07 20:07:57,033 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2025-02-07 20:07:57,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:07:57,033 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-02-07 20:07:57,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:07:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-02-07 20:07:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:07:57,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:07:57,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:07:57,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:07:57,033 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:07:57,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:07:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash 442967136, now seen corresponding path program 1 times [2025-02-07 20:07:57,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:07:57,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648118022] [2025-02-07 20:07:57,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:57,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:07:57,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:07:57,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:07:57,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:57,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:07:57,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648118022] [2025-02-07 20:07:57,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648118022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:07:57,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633024633] [2025-02-07 20:07:57,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:07:57,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:57,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:07:57,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:07:57,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:07:57,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:07:57,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:07:57,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:07:57,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:07:57,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-07 20:07:57,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:07:57,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-07 20:07:57,731 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:07:57,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-07 20:07:57,742 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-07 20:07:57,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:57,747 INFO L378 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 23 treesize of output 16 [2025-02-07 20:07:57,757 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-07 20:07:57,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:57,760 INFO L378 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 16 treesize of output 11 [2025-02-07 20:07:57,767 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-02-07 20:07:57,782 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2025-02-07 20:07:57,782 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 104 [2025-02-07 20:07:57,788 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:07:57,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:58,012 INFO L349 Elim1Store]: treesize reduction 126, result has 21.3 percent of original size [2025-02-07 20:07:58,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 477 treesize of output 412 [2025-02-07 20:07:58,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:58,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:07:58,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 86 [2025-02-07 20:07:58,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 800 treesize of output 705 [2025-02-07 20:07:58,117 INFO L349 Elim1Store]: treesize reduction 8, result has 89.3 percent of original size [2025-02-07 20:07:58,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 76 [2025-02-07 20:07:58,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2025-02-07 20:07:58,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 85 [2025-02-07 20:07:58,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 15 [2025-02-07 20:07:58,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 73 [2025-02-07 20:07:58,175 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-07 20:07:58,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:07:58,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:07:58,377 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: unsuccessful DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:170) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) 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:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) 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.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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) [2025-02-07 20:07:58,383 INFO L158 Benchmark]: Toolchain (without parser) took 25601.65ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 123.8MB in the beginning and 410.7MB in the end (delta: -286.9MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2025-02-07 20:07:58,383 INFO L158 Benchmark]: CDTParser took 4.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:07:58,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.49ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 106.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:07:58,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.95ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 104.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:07:58,384 INFO L158 Benchmark]: Boogie Preprocessor took 26.15ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:07:58,384 INFO L158 Benchmark]: IcfgBuilder took 268.80ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 86.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:07:58,384 INFO L158 Benchmark]: TraceAbstraction took 24939.99ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 85.5MB in the beginning and 410.7MB in the end (delta: -325.2MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2025-02-07 20:07:58,385 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.49ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 106.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.95ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 104.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.15ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 268.80ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 86.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24939.99ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 85.5MB in the beginning and 410.7MB in the end (delta: -325.2MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: unsuccessful DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: unsuccessful DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:170) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-02-07 20:07:58,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:08:00,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:08:00,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 20:08:00,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:08:00,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:08:00,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:08:00,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:08:00,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:08:00,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:08:00,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:08:00,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:08:00,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:08:00,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:08:00,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:08:00,495 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:08:00,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:08:00,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:08:00,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:08:00,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:08:00,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:08:00,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:08:00,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:08:00,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:08:00,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:08:00,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:08:00,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:08:00,497 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2025-02-07 20:08:00,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:08:00,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:08:00,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:08:00,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:08:00,823 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:08:00,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-07 20:08:02,141 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fa7f930a/e7f969084d874b2dbc87310f182682a3/FLAGe6fabace8 [2025-02-07 20:08:02,352 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:08:02,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-07 20:08:02,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fa7f930a/e7f969084d874b2dbc87310f182682a3/FLAGe6fabace8 [2025-02-07 20:08:02,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7fa7f930a/e7f969084d874b2dbc87310f182682a3 [2025-02-07 20:08:02,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:08:02,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:08:02,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:08:02,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:08:02,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:08:02,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:08:02" (1/1) ... [2025-02-07 20:08:02,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cdfa230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:02, skipping insertion in model container [2025-02-07 20:08:02,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:08:02" (1/1) ... [2025-02-07 20:08:02,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:08:02,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-02-07 20:08:02,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-02-07 20:08:02,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-02-07 20:08:02,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-02-07 20:08:02,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-02-07 20:08:02,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-02-07 20:08:02,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:08:02,936 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:08:02,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2025-02-07 20:08:02,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2025-02-07 20:08:02,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2025-02-07 20:08:02,983 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2025-02-07 20:08:02,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2025-02-07 20:08:02,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2025-02-07 20:08:02,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:08:03,006 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:08:03,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03 WrapperNode [2025-02-07 20:08:03,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:08:03,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:08:03,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:08:03,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:08:03,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,040 INFO L138 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2025-02-07 20:08:03,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:08:03,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:08:03,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:08:03,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:08:03,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,059 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-02-07 20:08:03,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:08:03,081 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:08:03,081 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:08:03,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:08:03,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (1/1) ... [2025-02-07 20:08:03,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:08:03,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:03,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:08:03,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:08:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-07 20:08:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-07 20:08:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:08:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:08:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:08:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:08:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:08:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:08:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:08:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-07 20:08:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-07 20:08:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 20:08:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 20:08:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:08:03,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:08:03,235 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:08:03,239 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:08:03,852 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-02-07 20:08:03,853 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:08:03,864 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:08:03,864 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:08:03,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:08:03 BoogieIcfgContainer [2025-02-07 20:08:03,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:08:03,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:08:03,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:08:03,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:08:03,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:08:02" (1/3) ... [2025-02-07 20:08:03,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc82193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:08:03, skipping insertion in model container [2025-02-07 20:08:03,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:03" (2/3) ... [2025-02-07 20:08:03,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc82193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:08:03, skipping insertion in model container [2025-02-07 20:08:03,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:08:03" (3/3) ... [2025-02-07 20:08:03,871 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2025-02-07 20:08:03,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:08:03,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-token-1.i that has 1 procedures, 44 locations, 1 initial locations, 9 loop locations, and 6 error locations. [2025-02-07 20:08:03,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:08:03,925 INFO L333 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=PETRI_NET, 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;@144052f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:08:03,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-07 20:08:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 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-02-07 20:08:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:08:03,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:03,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:08:03,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:08:03,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:03,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1368149575, now seen corresponding path program 1 times [2025-02-07 20:08:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:03,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496590475] [2025-02-07 20:08:03,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:03,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:03,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:03,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:03,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:08:04,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:08:04,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:08:04,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:04,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:04,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-07 20:08:04,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:04,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-07 20:08:04,162 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-07 20:08:04,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 28 [2025-02-07 20:08:04,183 INFO L378 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 18 treesize of output 16 [2025-02-07 20:08:04,203 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-07 20:08:04,203 INFO L378 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 1 case distinctions, treesize of input 13 treesize of output 13 [2025-02-07 20:08:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:04,223 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:08:04,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:08:04,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496590475] [2025-02-07 20:08:04,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496590475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:04,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24187491] [2025-02-07 20:08:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:04,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:08:04,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:08:04,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:08:04,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:08:04,246 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 43 states have internal predecessors, (67), 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-02-07 20:08:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:05,225 INFO L93 Difference]: Finished difference Result 85 states and 131 transitions. [2025-02-07 20:08:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:08:05,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-02-07 20:08:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:05,231 INFO L225 Difference]: With dead ends: 85 [2025-02-07 20:08:05,231 INFO L226 Difference]: Without dead ends: 38 [2025-02-07 20:08:05,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:08:05,234 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:05,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 20:08:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-07 20:08:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-07 20:08:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 37 states have internal predecessors, (40), 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-02-07 20:08:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-02-07 20:08:05,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 6 [2025-02-07 20:08:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:05,253 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-02-07 20:08:05,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-02-07 20:08:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-02-07 20:08:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:08:05,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:05,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:05,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:05,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:05,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:08:05,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash 535897151, now seen corresponding path program 1 times [2025-02-07 20:08:05,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:05,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849385097] [2025-02-07 20:08:05,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:05,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:05,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:05,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:08:05,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:08:05,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:08:05,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:05,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:05,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:08:05,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:05,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:08:05,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:08:05,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849385097] [2025-02-07 20:08:05,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849385097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:05,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:05,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408309782] [2025-02-07 20:08:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:05,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:08:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:08:05,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:08:05,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:08:05,554 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-07 20:08:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:05,759 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-02-07 20:08:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:08:05,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-02-07 20:08:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:05,760 INFO L225 Difference]: With dead ends: 58 [2025-02-07 20:08:05,760 INFO L226 Difference]: Without dead ends: 56 [2025-02-07 20:08:05,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:08:05,760 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 68 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:05,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:08:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-07 20:08:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2025-02-07 20:08:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 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-02-07 20:08:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-02-07 20:08:05,770 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 7 [2025-02-07 20:08:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:05,770 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-02-07 20:08:05,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-02-07 20:08:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-02-07 20:08:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:08:05,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:05,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:05,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:05,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:05,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:08:05,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1017311693, now seen corresponding path program 1 times [2025-02-07 20:08:05,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:05,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656798079] [2025-02-07 20:08:05,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:05,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:05,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:05,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:05,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:08:06,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:08:06,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:08:06,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:06,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:06,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 20:08:06,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:06,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-07 20:08:06,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:06,153 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2025-02-07 20:08:06,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:06,162 INFO L378 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 16 treesize of output 11 [2025-02-07 20:08:06,176 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-07 20:08:06,177 INFO L378 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 13 treesize of output 13 [2025-02-07 20:08:06,185 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:08:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:06,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:08:06,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:08:06,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656798079] [2025-02-07 20:08:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656798079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:06,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:08:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275729349] [2025-02-07 20:08:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:08:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:08:06,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:08:06,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:08:06,240 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-02-07 20:08:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:08,425 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-02-07 20:08:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:08:08,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2025-02-07 20:08:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:08,426 INFO L225 Difference]: With dead ends: 76 [2025-02-07 20:08:08,426 INFO L226 Difference]: Without dead ends: 50 [2025-02-07 20:08:08,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:08:08,426 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:08,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-07 20:08:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-07 20:08:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2025-02-07 20:08:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-02-07 20:08:08,436 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 12 [2025-02-07 20:08:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:08,436 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-02-07 20:08:08,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-02-07 20:08:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-02-07 20:08:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 20:08:08,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:08,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:08,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:08,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:08,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:08:08,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1017332547, now seen corresponding path program 1 times [2025-02-07 20:08:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:08,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302031172] [2025-02-07 20:08:08,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:08,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:08,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:08:08,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 20:08:08,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 20:08:08,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:08,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:08,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 20:08:08,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:08,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:08:08,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:08:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302031172] [2025-02-07 20:08:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302031172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:08,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:08,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:08:08,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556200916] [2025-02-07 20:08:08,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:08,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:08:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:08:08,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:08:08,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:08:08,776 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-07 20:08:09,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:09,505 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2025-02-07 20:08:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:08:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2025-02-07 20:08:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:09,506 INFO L225 Difference]: With dead ends: 44 [2025-02-07 20:08:09,506 INFO L226 Difference]: Without dead ends: 42 [2025-02-07 20:08:09,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:08:09,508 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:09,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 96 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 20:08:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-07 20:08:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-07 20:08:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-02-07 20:08:09,518 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 12 [2025-02-07 20:08:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:09,519 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-02-07 20:08:09,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-07 20:08:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-02-07 20:08:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 20:08:09,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:09,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:09,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 20:08:09,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:09,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:08:09,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -392310435, now seen corresponding path program 1 times [2025-02-07 20:08:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702491273] [2025-02-07 20:08:09,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:09,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:09,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:09,725 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:09,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:08:09,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 20:08:09,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 20:08:09,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:09,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:09,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 20:08:09,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:09,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-07 20:08:09,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:09,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:09,868 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2025-02-07 20:08:09,877 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 56 [2025-02-07 20:08:09,896 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-07 20:08:09,896 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 65 [2025-02-07 20:08:09,921 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-07 20:08:09,922 INFO L378 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 1 case distinctions, treesize of input 90 treesize of output 83 [2025-02-07 20:08:09,933 INFO L378 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 5 treesize of output 3 [2025-02-07 20:08:09,939 INFO L378 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 23 treesize of output 15 [2025-02-07 20:08:09,942 INFO L378 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 15 treesize of output 13 [2025-02-07 20:08:09,951 INFO L378 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 19 treesize of output 11 [2025-02-07 20:08:09,968 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2025-02-07 20:08:09,969 INFO L378 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 17 treesize of output 17 [2025-02-07 20:08:10,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2025-02-07 20:08:10,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-07 20:08:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:10,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:08:10,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:08:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702491273] [2025-02-07 20:08:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702491273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:10,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:08:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481580781] [2025-02-07 20:08:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:10,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:08:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:08:10,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:08:10,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:08:10,100 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-02-07 20:08:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:11,824 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2025-02-07 20:08:11,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:08:11,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 16 [2025-02-07 20:08:11,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:11,825 INFO L225 Difference]: With dead ends: 52 [2025-02-07 20:08:11,826 INFO L226 Difference]: Without dead ends: 50 [2025-02-07 20:08:11,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:08:11,826 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:11,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 115 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-07 20:08:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-07 20:08:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-02-07 20:08:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 47 states have internal predecessors, (51), 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-02-07 20:08:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-02-07 20:08:11,836 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 16 [2025-02-07 20:08:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:11,836 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-02-07 20:08:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-02-07 20:08:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-02-07 20:08:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:08:11,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:11,837 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:11,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:08:12,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:12,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:08:12,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1489126683, now seen corresponding path program 1 times [2025-02-07 20:08:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:12,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49281801] [2025-02-07 20:08:12,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:12,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:12,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:12,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:12,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:08:12,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:08:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:08:12,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:12,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:12,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-07 20:08:12,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:12,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-07 20:08:12,161 INFO L378 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 11 treesize of output 7 [2025-02-07 20:08:12,232 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2025-02-07 20:08:12,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 22 [2025-02-07 20:08:12,242 INFO L378 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 5 treesize of output 3 [2025-02-07 20:08:12,262 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-07 20:08:12,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-02-07 20:08:12,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2025-02-07 20:08:12,282 INFO L378 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 16 treesize of output 11 [2025-02-07 20:08:12,294 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:08:12,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:12,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:12,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-02-07 20:08:12,457 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-07 20:08:12,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-02-07 20:08:12,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:12,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:12,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:12,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:16,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:16,886 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 100 [2025-02-07 20:08:16,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 196 treesize of output 148 [2025-02-07 20:08:16,902 INFO L378 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 112 treesize of output 106 [2025-02-07 20:08:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:17,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:08:17,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49281801] [2025-02-07 20:08:17,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49281801] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:17,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:08:17,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-07 20:08:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603777888] [2025-02-07 20:08:17,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:17,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 20:08:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:08:17,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 20:08:17,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=48, Unknown=3, NotChecked=0, Total=72 [2025-02-07 20:08:17,314 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-02-07 20:08:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:21,973 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2025-02-07 20:08:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:08:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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) Word has length 17 [2025-02-07 20:08:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:21,975 INFO L225 Difference]: With dead ends: 60 [2025-02-07 20:08:21,975 INFO L226 Difference]: Without dead ends: 58 [2025-02-07 20:08:21,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=35, Invalid=72, Unknown=3, NotChecked=0, Total=110 [2025-02-07 20:08:21,976 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 31 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:21,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 159 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-07 20:08:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-07 20:08:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2025-02-07 20:08:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 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-02-07 20:08:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-02-07 20:08:21,983 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2025-02-07 20:08:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:21,983 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-02-07 20:08:21,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-02-07 20:08:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-02-07 20:08:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 20:08:21,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:21,983 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:21,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 20:08:22,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:22,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:08:22,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1931922859, now seen corresponding path program 1 times [2025-02-07 20:08:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627373975] [2025-02-07 20:08:22,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:22,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:22,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:22,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 20:08:22,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 20:08:22,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:08:22,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:22,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:22,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-07 20:08:22,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:22,314 INFO L378 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 11 treesize of output 7 [2025-02-07 20:08:22,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-07 20:08:22,367 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:08:22,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 19 treesize of output 23 [2025-02-07 20:08:22,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:22,385 INFO L378 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 35 treesize of output 18 [2025-02-07 20:08:22,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 [2025-02-07 20:08:22,398 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:08:22,402 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:22,403 INFO L378 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 26 treesize of output 14 [2025-02-07 20:08:22,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2025-02-07 20:08:22,505 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2025-02-07 20:08:22,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 100 treesize of output 60 [2025-02-07 20:08:22,524 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 50 [2025-02-07 20:08:22,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 94 treesize of output 58 [2025-02-07 20:08:22,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 62 [2025-02-07 20:08:22,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2025-02-07 20:08:22,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 115 treesize of output 75 [2025-02-07 20:08:22,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:22,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-02-07 20:08:22,607 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-07 20:08:22,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2025-02-07 20:08:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:22,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:22,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:22,681 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-02-07 20:08:22,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 74 treesize of output 54 [2025-02-07 20:08:22,688 INFO L378 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 47 treesize of output 45 [2025-02-07 20:08:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:23,735 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:08:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627373975] [2025-02-07 20:08:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627373975] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:23,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:08:23,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 20:08:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330566346] [2025-02-07 20:08:23,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:23,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:08:23,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:08:23,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:08:23,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=64, Unknown=2, NotChecked=0, Total=90 [2025-02-07 20:08:23,737 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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-02-07 20:08:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:28,175 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2025-02-07 20:08:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:08:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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) Word has length 21 [2025-02-07 20:08:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:28,180 INFO L225 Difference]: With dead ends: 70 [2025-02-07 20:08:28,180 INFO L226 Difference]: Without dead ends: 54 [2025-02-07 20:08:28,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=91, Unknown=2, NotChecked=0, Total=132 [2025-02-07 20:08:28,181 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:28,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 171 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-07 20:08:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-07 20:08:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-02-07 20:08:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 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-02-07 20:08:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2025-02-07 20:08:28,191 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 21 [2025-02-07 20:08:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:28,191 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2025-02-07 20:08:28,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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-02-07 20:08:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2025-02-07 20:08:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:08:28,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:28,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:28,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:28,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:28,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:08:28,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2058728493, now seen corresponding path program 1 times [2025-02-07 20:08:28,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:28,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172175557] [2025-02-07 20:08:28,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:28,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:28,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:28,396 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:28,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 20:08:28,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:08:28,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:08:28,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:28,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:28,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 20:08:28,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:28,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:08:28,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 20:08:28,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172175557] [2025-02-07 20:08:28,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172175557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:28,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:28,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:08:28,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755701554] [2025-02-07 20:08:28,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:28,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:08:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 20:08:28,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:08:28,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:08:28,489 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:28,766 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2025-02-07 20:08:28,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:08:28,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 20:08:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:28,767 INFO L225 Difference]: With dead ends: 52 [2025-02-07 20:08:28,767 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 20:08:28,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:08:28,768 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:28,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:08:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 20:08:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-07 20:08:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 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-02-07 20:08:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-02-07 20:08:28,771 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2025-02-07 20:08:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:28,771 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-02-07 20:08:28,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-02-07 20:08:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:08:28,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:28,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:28,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 20:08:28,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:28,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-07 20:08:28,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 442967136, now seen corresponding path program 1 times [2025-02-07 20:08:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 20:08:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916211035] [2025-02-07 20:08:28,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:28,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:28,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:28,975 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:28,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 20:08:29,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:08:29,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:08:29,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:29,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:29,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 20:08:29,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:29,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-07 20:08:29,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:29,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:29,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2025-02-07 20:08:29,106 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-07 20:08:29,120 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-07 20:08:29,121 INFO L378 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 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-07 20:08:29,131 INFO L378 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 5 treesize of output 3 [2025-02-07 20:08:29,157 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-07 20:08:29,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-02-07 20:08:29,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:29,191 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-07 20:08:29,196 INFO L378 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 16 treesize of output 11 [2025-02-07 20:08:29,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:29,503 INFO L349 Elim1Store]: treesize reduction 195, result has 0.5 percent of original size [2025-02-07 20:08:29,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 268 treesize of output 252 [2025-02-07 20:08:29,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:29,536 INFO L349 Elim1Store]: treesize reduction 195, result has 0.5 percent of original size [2025-02-07 20:08:29,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 265 treesize of output 247 [2025-02-07 20:08:29,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:29,567 INFO L349 Elim1Store]: treesize reduction 124, result has 0.8 percent of original size [2025-02-07 20:08:29,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 229 treesize of output 214 [2025-02-07 20:08:29,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:29,738 INFO L349 Elim1Store]: treesize reduction 103, result has 17.6 percent of original size [2025-02-07 20:08:29,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 278 treesize of output 270 [2025-02-07 20:08:29,761 INFO L349 Elim1Store]: treesize reduction 83, result has 1.2 percent of original size [2025-02-07 20:08:29,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 22 [2025-02-07 20:08:29,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 1 [2025-02-07 20:08:29,777 INFO L349 Elim1Store]: treesize reduction 6, result has 66.7 percent of original size [2025-02-07 20:08:29,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2025-02-07 20:08:29,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2025-02-07 20:08:29,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 1 [2025-02-07 20:08:29,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 23 [2025-02-07 20:08:29,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 11 [2025-02-07 20:08:29,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:08:29,955 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2025-02-07 20:08:29,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-07 20:08:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:29,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:30,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:30,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 84 [2025-02-07 20:08:30,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:30,124 INFO L378 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 893 treesize of output 897 [2025-02-07 20:08:30,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:30,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 848 treesize of output 830 [2025-02-07 20:08:30,154 INFO L378 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 824 treesize of output 700 [2025-02-07 20:08:30,173 INFO L378 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 700 treesize of output 638 [2025-02-07 20:08:30,221 INFO L378 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 34 treesize of output 3 [2025-02-07 20:08:30,326 INFO L378 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 239 treesize of output 208 [2025-02-07 20:08:30,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:30,657 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 751 treesize of output 640 [2025-02-07 20:08:31,100 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-02-07 20:08:31,101 INFO L378 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 59550 treesize of output 58385 [2025-02-07 20:08:31,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:31,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9482 treesize of output 8070 [2025-02-07 20:08:32,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:32,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11789 treesize of output 10559 [2025-02-07 20:08:32,565 INFO L378 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 4697 treesize of output 4625 [2025-02-07 20:08:32,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:32,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4625 treesize of output 4494 [2025-02-07 20:08:32,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:32,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4486 treesize of output 4084 [2025-02-07 20:08:33,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:33,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4019 treesize of output 3918 [2025-02-07 20:08:33,179 INFO L378 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 3869 treesize of output 3853 [2025-02-07 20:08:33,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:33,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3853 treesize of output 3742 [2025-02-07 20:08:33,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:33,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3693 treesize of output 3670 [2025-02-07 20:08:33,651 INFO L378 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 3645 treesize of output 3597 [2025-02-07 20:08:33,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:33,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3597 treesize of output 3568 [2025-02-07 20:08:34,039 INFO L378 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 3519 treesize of output 3477 [2025-02-07 20:08:34,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:34,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3477 treesize of output 3438 [2025-02-07 20:08:34,368 INFO L378 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 3413 treesize of output 3397