./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:08:06,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:08:06,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:08:06,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:08:06,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:08:06,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:08:06,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:08:06,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:08:06,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:08:06,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:08:06,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:08:06,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:08:06,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:08:06,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:08:06,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:08:06,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:08:06,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:08:06,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:08:06,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:08:06,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:08:06,930 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:08:06,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:08:06,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:08:06,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:08:06,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:08:06,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:08:06,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:08:06,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:08:06,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:08:06,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:08:06,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:08:06,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:08:06,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:08:06,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:08:06,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:08:06,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:08:06,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:08:06,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:08:06,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:08:06,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:08:06,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:08:06,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:08:06,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-12 18:08:06,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:08:06,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:08:06,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:08:06,956 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:08:06,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:08:06,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:08:06,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:08:06,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:08:06,957 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:08:06,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:08:06,958 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:08:06,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:08:06,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:08:06,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:08:06,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:08:06,958 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:08:06,959 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:08:06,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:08:06,959 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:08:06,959 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:08:06,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:08:06,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:08:06,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:08:06,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:08:06,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:08:06,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:08:06,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:08:06,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:08:06,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:08:06,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-memcleanup) ) 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 -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2022-07-12 18:08:07,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:08:07,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:08:07,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:08:07,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:08:07,150 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:08:07,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-12 18:08:07,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf63267a/7246da4caa3b4233a754bd2310ae02c0/FLAG191565b88 [2022-07-12 18:08:07,585 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:08:07,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-12 18:08:07,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf63267a/7246da4caa3b4233a754bd2310ae02c0/FLAG191565b88 [2022-07-12 18:08:07,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf63267a/7246da4caa3b4233a754bd2310ae02c0 [2022-07-12 18:08:07,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:08:07,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:08:07,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:08:07,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:08:07,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:08:07,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:08:07" (1/1) ... [2022-07-12 18:08:07,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6b061c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:07, skipping insertion in model container [2022-07-12 18:08:07,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:08:07" (1/1) ... [2022-07-12 18:08:08,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:08:08,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:08:08,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-07-12 18:08:08,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-07-12 18:08:08,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-07-12 18:08:08,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-07-12 18:08:08,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-07-12 18:08:08,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-07-12 18:08:08,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-07-12 18:08:08,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-07-12 18:08:08,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-07-12 18:08:08,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-07-12 18:08:08,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-07-12 18:08:08,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-07-12 18:08:08,252 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-07-12 18:08:08,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-07-12 18:08:08,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:08:08,266 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:08:08,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-07-12 18:08:08,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-07-12 18:08:08,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-07-12 18:08:08,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-07-12 18:08:08,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-07-12 18:08:08,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-07-12 18:08:08,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-07-12 18:08:08,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-07-12 18:08:08,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-07-12 18:08:08,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-07-12 18:08:08,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-07-12 18:08:08,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-07-12 18:08:08,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-07-12 18:08:08,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-07-12 18:08:08,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:08:08,335 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:08:08,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08 WrapperNode [2022-07-12 18:08:08,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:08:08,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:08:08,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:08:08,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:08:08,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,378 INFO L137 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 222 [2022-07-12 18:08:08,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:08:08,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:08:08,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:08:08,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:08:08,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:08:08,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:08:08,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:08:08,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:08:08,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (1/1) ... [2022-07-12 18:08:08,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:08:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:08,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:08:08,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:08:08,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:08:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:08:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:08:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:08:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:08:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:08:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:08:08,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:08:08,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:08:08,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:08:08,526 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:08:08,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:08:08,814 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:08:08,819 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:08:08,819 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-12 18:08:08,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:08:08 BoogieIcfgContainer [2022-07-12 18:08:08,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:08:08,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:08:08,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:08:08,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:08:08,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:08:07" (1/3) ... [2022-07-12 18:08:08,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e35344d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:08:08, skipping insertion in model container [2022-07-12 18:08:08,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:08" (2/3) ... [2022-07-12 18:08:08,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e35344d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:08:08, skipping insertion in model container [2022-07-12 18:08:08,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:08:08" (3/3) ... [2022-07-12 18:08:08,826 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2022-07-12 18:08:08,835 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:08:08,836 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-12 18:08:08,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:08:08,882 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6fccd285, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f9dde23 [2022-07-12 18:08:08,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-12 18:08:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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) [2022-07-12 18:08:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:08:08,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:08,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:08:08,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:08:08,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:08,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166474687] [2022-07-12 18:08:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:09,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166474687] [2022-07-12 18:08:09,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166474687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:09,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:09,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:08:09,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180242430] [2022-07-12 18:08:09,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:09,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:09,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:09,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:09,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:09,126 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:08:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:09,248 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-07-12 18:08:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:09,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-12 18:08:09,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:09,256 INFO L225 Difference]: With dead ends: 169 [2022-07-12 18:08:09,256 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 18:08:09,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:09,260 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:09,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 109 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 18:08:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-12 18:08:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 160 states have internal predecessors, (173), 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) [2022-07-12 18:08:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-07-12 18:08:09,287 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 3 [2022-07-12 18:08:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:09,288 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-07-12 18:08:09,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:08:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-07-12 18:08:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:08:09,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:09,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:08:09,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:08:09,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:08:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:09,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505795935] [2022-07-12 18:08:09,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:09,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:09,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505795935] [2022-07-12 18:08:09,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505795935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:09,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:09,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:08:09,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395283865] [2022-07-12 18:08:09,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:09,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:09,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:09,323 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:08:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:09,399 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-12 18:08:09,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:09,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-12 18:08:09,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:09,400 INFO L225 Difference]: With dead ends: 155 [2022-07-12 18:08:09,400 INFO L226 Difference]: Without dead ends: 155 [2022-07-12 18:08:09,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:09,402 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:09,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 112 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-12 18:08:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-12 18:08:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.603960396039604) internal successors, (162), 150 states have internal predecessors, (162), 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) [2022-07-12 18:08:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-07-12 18:08:09,409 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-07-12 18:08:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:09,409 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-07-12 18:08:09,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:08:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-07-12 18:08:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:08:09,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:09,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:09,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:08:09,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-07-12 18:08:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:09,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952974199] [2022-07-12 18:08:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:09,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952974199] [2022-07-12 18:08:09,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952974199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:09,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:09,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:09,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594368238] [2022-07-12 18:08:09,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:09,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:08:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:09,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:08:09,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:08:09,458 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 18:08:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:09,560 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-07-12 18:08:09,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:08:09,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-07-12 18:08:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:09,564 INFO L225 Difference]: With dead ends: 161 [2022-07-12 18:08:09,564 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 18:08:09,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:08:09,566 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 260 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:09,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 116 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 18:08:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2022-07-12 18:08:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.5555555555555556) internal successors, (168), 152 states have internal predecessors, (168), 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) [2022-07-12 18:08:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2022-07-12 18:08:09,584 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 8 [2022-07-12 18:08:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:09,585 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2022-07-12 18:08:09,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 18:08:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2022-07-12 18:08:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:08:09,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:09,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:09,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:08:09,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:09,591 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-07-12 18:08:09,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:09,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988449597] [2022-07-12 18:08:09,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:09,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:09,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988449597] [2022-07-12 18:08:09,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988449597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:09,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:09,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67829309] [2022-07-12 18:08:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:09,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:08:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:09,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:08:09,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:08:09,641 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 18:08:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:09,769 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2022-07-12 18:08:09,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:08:09,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-07-12 18:08:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:09,770 INFO L225 Difference]: With dead ends: 244 [2022-07-12 18:08:09,770 INFO L226 Difference]: Without dead ends: 244 [2022-07-12 18:08:09,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:08:09,771 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:09,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 184 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:09,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-12 18:08:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2022-07-12 18:08:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5309734513274336) internal successors, (173), 157 states have internal predecessors, (173), 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) [2022-07-12 18:08:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2022-07-12 18:08:09,776 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 8 [2022-07-12 18:08:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:09,776 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2022-07-12 18:08:09,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 18:08:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2022-07-12 18:08:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 18:08:09,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:09,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:09,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:08:09,777 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:09,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:09,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1837174119, now seen corresponding path program 1 times [2022-07-12 18:08:09,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:09,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350837052] [2022-07-12 18:08:09,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:09,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350837052] [2022-07-12 18:08:09,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350837052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:09,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:09,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92406781] [2022-07-12 18:08:09,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:09,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:09,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:09,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:09,804 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-12 18:08:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:09,832 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-07-12 18:08:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-12 18:08:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:09,834 INFO L225 Difference]: With dead ends: 148 [2022-07-12 18:08:09,834 INFO L226 Difference]: Without dead ends: 148 [2022-07-12 18:08:09,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:09,835 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 125 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:09,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:08:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-12 18:08:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-12 18:08:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.5) internal successors, (162), 147 states have internal predecessors, (162), 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) [2022-07-12 18:08:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-07-12 18:08:09,844 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 9 [2022-07-12 18:08:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:09,844 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-07-12 18:08:09,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-12 18:08:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-07-12 18:08:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:08:09,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:09,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:09,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:08:09,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:09,846 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-12 18:08:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:09,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784382797] [2022-07-12 18:08:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:09,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784382797] [2022-07-12 18:08:09,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784382797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:09,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:09,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:08:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296760362] [2022-07-12 18:08:09,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:09,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:09,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:09,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:09,890 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 6 states, 5 states have (on average 2.4) 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) [2022-07-12 18:08:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:10,075 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2022-07-12 18:08:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:08:10,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) 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 [2022-07-12 18:08:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:10,077 INFO L225 Difference]: With dead ends: 219 [2022-07-12 18:08:10,077 INFO L226 Difference]: Without dead ends: 219 [2022-07-12 18:08:10,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:08:10,078 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:10,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 682 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-12 18:08:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 147. [2022-07-12 18:08:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 146 states have internal predecessors, (161), 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) [2022-07-12 18:08:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-12 18:08:10,081 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 12 [2022-07-12 18:08:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:10,082 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-12 18:08:10,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) 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) [2022-07-12 18:08:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-12 18:08:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:08:10,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:10,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:10,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:08:10,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:10,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-12 18:08:10,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:10,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284157493] [2022-07-12 18:08:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:10,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:10,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284157493] [2022-07-12 18:08:10,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284157493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:10,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:10,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:08:10,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623648599] [2022-07-12 18:08:10,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:10,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:10,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:10,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:10,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:10,170 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 5 states have (on average 2.4) 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) [2022-07-12 18:08:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:10,376 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2022-07-12 18:08:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:08:10,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) 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 [2022-07-12 18:08:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:10,377 INFO L225 Difference]: With dead ends: 211 [2022-07-12 18:08:10,377 INFO L226 Difference]: Without dead ends: 211 [2022-07-12 18:08:10,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:08:10,378 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 97 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:10,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 676 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-12 18:08:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 136. [2022-07-12 18:08:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 135 states have internal predecessors, (149), 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) [2022-07-12 18:08:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-12 18:08:10,381 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 12 [2022-07-12 18:08:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:10,381 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-12 18:08:10,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) 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) [2022-07-12 18:08:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-12 18:08:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:08:10,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:10,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:10,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:08:10,382 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:10,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1603335132, now seen corresponding path program 1 times [2022-07-12 18:08:10,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:10,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106628656] [2022-07-12 18:08:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:10,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:10,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106628656] [2022-07-12 18:08:10,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106628656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:10,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:10,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:10,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386334246] [2022-07-12 18:08:10,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:10,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:10,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:10,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:10,426 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-07-12 18:08:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:10,442 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-07-12 18:08:10,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:10,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-07-12 18:08:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:10,443 INFO L225 Difference]: With dead ends: 191 [2022-07-12 18:08:10,444 INFO L226 Difference]: Without dead ends: 191 [2022-07-12 18:08:10,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:10,444 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:10,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 250 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:08:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-12 18:08:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2022-07-12 18:08:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 148 states have internal predecessors, (163), 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) [2022-07-12 18:08:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-07-12 18:08:10,448 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 15 [2022-07-12 18:08:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:10,448 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-07-12 18:08:10,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-07-12 18:08:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-07-12 18:08:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:08:10,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:10,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:10,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:08:10,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash -775737061, now seen corresponding path program 1 times [2022-07-12 18:08:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:10,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444320986] [2022-07-12 18:08:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:10,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:10,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444320986] [2022-07-12 18:08:10,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444320986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:10,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:10,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:08:10,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529557488] [2022-07-12 18:08:10,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:10,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:10,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:10,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:10,503 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-12 18:08:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:10,590 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2022-07-12 18:08:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:08:10,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2022-07-12 18:08:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:10,591 INFO L225 Difference]: With dead ends: 149 [2022-07-12 18:08:10,591 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 18:08:10,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:08:10,592 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:10,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 541 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 18:08:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-07-12 18:08:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.4) internal successors, (161), 146 states have internal predecessors, (161), 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) [2022-07-12 18:08:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-12 18:08:10,595 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 19 [2022-07-12 18:08:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:10,595 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-12 18:08:10,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-12 18:08:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-12 18:08:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:08:10,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:10,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:10,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:08:10,596 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash 73317399, now seen corresponding path program 1 times [2022-07-12 18:08:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:10,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571516338] [2022-07-12 18:08:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:10,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:10,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571516338] [2022-07-12 18:08:10,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571516338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:10,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:10,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:08:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123621760] [2022-07-12 18:08:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:10,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:10,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:10,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:10,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:10,643 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:10,743 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-12 18:08:10,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:08:10,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 18:08:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:10,744 INFO L225 Difference]: With dead ends: 156 [2022-07-12 18:08:10,744 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 18:08:10,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:08:10,745 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:10,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 572 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 18:08:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-12 18:08:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 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) [2022-07-12 18:08:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-12 18:08:10,748 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 20 [2022-07-12 18:08:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:10,748 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-12 18:08:10,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-12 18:08:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:08:10,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:10,749 INFO L195 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] [2022-07-12 18:08:10,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:08:10,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash -800612379, now seen corresponding path program 1 times [2022-07-12 18:08:10,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:10,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783807851] [2022-07-12 18:08:10,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:10,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:10,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783807851] [2022-07-12 18:08:10,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783807851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:10,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:10,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:08:10,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030931768] [2022-07-12 18:08:10,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:10,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:08:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:10,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:08:10,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:08:10,786 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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) [2022-07-12 18:08:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:10,857 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-07-12 18:08:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:08:10,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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 [2022-07-12 18:08:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:10,858 INFO L225 Difference]: With dead ends: 152 [2022-07-12 18:08:10,858 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 18:08:10,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:08:10,859 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:10,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 18:08:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-12 18:08:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.375) internal successors, (165), 151 states have internal predecessors, (165), 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) [2022-07-12 18:08:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-07-12 18:08:10,862 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 22 [2022-07-12 18:08:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:10,862 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-07-12 18:08:10,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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) [2022-07-12 18:08:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-07-12 18:08:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:08:10,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:10,863 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:10,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:08:10,863 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:10,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1089542561, now seen corresponding path program 1 times [2022-07-12 18:08:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:10,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591629191] [2022-07-12 18:08:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:10,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:10,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:10,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591629191] [2022-07-12 18:08:10,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591629191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:10,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488047301] [2022-07-12 18:08:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:10,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:10,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:10,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 18:08:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:10,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:08:10,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:11,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:08:11,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:08:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:11,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:11,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488047301] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:11,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:11,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2022-07-12 18:08:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927341031] [2022-07-12 18:08:11,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:11,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:08:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:11,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:08:11,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:08:11,184 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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) [2022-07-12 18:08:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:11,426 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2022-07-12 18:08:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:08:11,427 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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 25 [2022-07-12 18:08:11,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:11,428 INFO L225 Difference]: With dead ends: 181 [2022-07-12 18:08:11,428 INFO L226 Difference]: Without dead ends: 181 [2022-07-12 18:08:11,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:08:11,428 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 155 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:11,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 712 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-12 18:08:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2022-07-12 18:08:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 130 states have (on average 1.353846153846154) internal successors, (176), 161 states have internal predecessors, (176), 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) [2022-07-12 18:08:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2022-07-12 18:08:11,431 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 25 [2022-07-12 18:08:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:11,431 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2022-07-12 18:08:11,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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) [2022-07-12 18:08:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2022-07-12 18:08:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:08:11,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:11,432 INFO L195 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, 1, 1, 1, 1] [2022-07-12 18:08:11,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 18:08:11,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 18:08:11,639 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:11,640 INFO L85 PathProgramCache]: Analyzing trace with hash 583917852, now seen corresponding path program 1 times [2022-07-12 18:08:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:11,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601247746] [2022-07-12 18:08:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:11,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601247746] [2022-07-12 18:08:11,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601247746] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:11,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473668951] [2022-07-12 18:08:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:11,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:11,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:11,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:11,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 18:08:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:11,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:08:11,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:11,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-12 18:08:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:11,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:11,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473668951] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:11,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:11,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-12 18:08:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748692406] [2022-07-12 18:08:11,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:11,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:11,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:11,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:11,889 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:11,982 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2022-07-12 18:08:11,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:08:11,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 18:08:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:11,984 INFO L225 Difference]: With dead ends: 172 [2022-07-12 18:08:11,984 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 18:08:11,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:08:11,984 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:11,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 378 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 18:08:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-12 18:08:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.371900826446281) internal successors, (166), 152 states have internal predecessors, (166), 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) [2022-07-12 18:08:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2022-07-12 18:08:11,987 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 26 [2022-07-12 18:08:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:11,987 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2022-07-12 18:08:11,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2022-07-12 18:08:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:08:11,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:11,988 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:12,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 18:08:12,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 18:08:12,202 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash -370767273, now seen corresponding path program 1 times [2022-07-12 18:08:12,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:12,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214918137] [2022-07-12 18:08:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:12,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:12,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214918137] [2022-07-12 18:08:12,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214918137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:12,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267335041] [2022-07-12 18:08:12,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:12,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:12,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:12,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:12,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 18:08:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:12,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:08:12,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:12,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:12,555 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:12,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-12 18:08:12,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:08:12,657 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:12,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 28 [2022-07-12 18:08:12,675 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:12,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-07-12 18:08:12,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-07-12 18:08:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:12,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:12,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 18:08:12,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 18:08:12,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 18:08:12,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:12,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-07-12 18:08:12,765 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:12,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 36 [2022-07-12 18:08:12,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-07-12 18:08:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:12,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267335041] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:12,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:12,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-12 18:08:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647533200] [2022-07-12 18:08:12,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:12,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 18:08:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:12,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 18:08:12,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=363, Unknown=3, NotChecked=120, Total=552 [2022-07-12 18:08:12,858 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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) [2022-07-12 18:08:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:13,311 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2022-07-12 18:08:13,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:08:13,311 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 29 [2022-07-12 18:08:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:13,312 INFO L225 Difference]: With dead ends: 281 [2022-07-12 18:08:13,312 INFO L226 Difference]: Without dead ends: 281 [2022-07-12 18:08:13,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=749, Unknown=3, NotChecked=180, Total=1122 [2022-07-12 18:08:13,313 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 527 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:13,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1402 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 901 Invalid, 0 Unknown, 531 Unchecked, 0.3s Time] [2022-07-12 18:08:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-12 18:08:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 168. [2022-07-12 18:08:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 167 states have internal predecessors, (183), 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) [2022-07-12 18:08:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-07-12 18:08:13,315 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 29 [2022-07-12 18:08:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:13,316 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-07-12 18:08:13,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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) [2022-07-12 18:08:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-07-12 18:08:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:08:13,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:13,316 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:13,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:13,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:13,517 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:13,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:13,517 INFO L85 PathProgramCache]: Analyzing trace with hash -751968760, now seen corresponding path program 1 times [2022-07-12 18:08:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:13,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583558429] [2022-07-12 18:08:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:13,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583558429] [2022-07-12 18:08:13,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583558429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:13,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:13,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067206425] [2022-07-12 18:08:13,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:13,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:13,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:13,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:13,541 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:13,553 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2022-07-12 18:08:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:13,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 18:08:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:13,554 INFO L225 Difference]: With dead ends: 239 [2022-07-12 18:08:13,554 INFO L226 Difference]: Without dead ends: 239 [2022-07-12 18:08:13,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:13,555 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 55 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:13,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:08:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-12 18:08:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 186. [2022-07-12 18:08:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 185 states have internal predecessors, (201), 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) [2022-07-12 18:08:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2022-07-12 18:08:13,585 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 30 [2022-07-12 18:08:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:13,586 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2022-07-12 18:08:13,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2022-07-12 18:08:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 18:08:13,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:13,586 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:13,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:08:13,586 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:13,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046208, now seen corresponding path program 1 times [2022-07-12 18:08:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:13,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467371592] [2022-07-12 18:08:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:13,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467371592] [2022-07-12 18:08:13,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467371592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:13,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873186841] [2022-07-12 18:08:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:13,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:13,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:13,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:13,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 18:08:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:13,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:08:13,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:13,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:14,006 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:08:14,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:14,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:08:14,178 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:14,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-12 18:08:14,223 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:14,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-12 18:08:14,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-12 18:08:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:14,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:14,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-12 18:08:14,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-12 18:08:14,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:14,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-07-12 18:08:14,548 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:14,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2022-07-12 18:08:14,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-12 18:08:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:18,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873186841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:18,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:18,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2022-07-12 18:08:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986187660] [2022-07-12 18:08:18,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 18:08:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 18:08:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=611, Unknown=11, NotChecked=106, Total=870 [2022-07-12 18:08:18,742 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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) [2022-07-12 18:08:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:19,476 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2022-07-12 18:08:19,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 18:08:19,477 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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 39 [2022-07-12 18:08:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:19,478 INFO L225 Difference]: With dead ends: 247 [2022-07-12 18:08:19,478 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 18:08:19,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=344, Invalid=1293, Unknown=11, NotChecked=158, Total=1806 [2022-07-12 18:08:19,479 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 270 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:19,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1287 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 662 Invalid, 0 Unknown, 689 Unchecked, 0.4s Time] [2022-07-12 18:08:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 18:08:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 197. [2022-07-12 18:08:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 165 states have (on average 1.309090909090909) internal successors, (216), 196 states have internal predecessors, (216), 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) [2022-07-12 18:08:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2022-07-12 18:08:19,482 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 39 [2022-07-12 18:08:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:19,482 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2022-07-12 18:08:19,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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) [2022-07-12 18:08:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2022-07-12 18:08:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 18:08:19,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:19,482 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:19,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:19,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 18:08:19,695 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046209, now seen corresponding path program 1 times [2022-07-12 18:08:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:19,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958555693] [2022-07-12 18:08:19,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:19,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958555693] [2022-07-12 18:08:19,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958555693] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:19,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416946482] [2022-07-12 18:08:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:19,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:19,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:19,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:19,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:08:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:20,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 18:08:20,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:20,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:20,069 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:20,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:08:20,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-12 18:08:20,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:08:20,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:20,218 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:08:20,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-07-12 18:08:20,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:20,234 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:20,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-12 18:08:20,295 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:20,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-07-12 18:08:20,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:08:20,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-12 18:08:20,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:08:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:20,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:20,614 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 18:08:20,629 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)))) is different from false [2022-07-12 18:08:20,637 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-12 18:08:20,649 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:20,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-07-12 18:08:20,655 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:20,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2022-07-12 18:08:20,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-12 18:08:20,672 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:20,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2022-07-12 18:08:20,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:20,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-12 18:08:20,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:20,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-12 18:08:20,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:20,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 18:08:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:20,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416946482] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:20,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:20,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2022-07-12 18:08:20,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550694473] [2022-07-12 18:08:20,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:20,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 18:08:20,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:20,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 18:08:20,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-07-12 18:08:20,774 INFO L87 Difference]: Start difference. First operand 197 states and 216 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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) [2022-07-12 18:08:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:22,594 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2022-07-12 18:08:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 18:08:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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 39 [2022-07-12 18:08:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:22,596 INFO L225 Difference]: With dead ends: 325 [2022-07-12 18:08:22,596 INFO L226 Difference]: Without dead ends: 325 [2022-07-12 18:08:22,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=471, Invalid=2294, Unknown=3, NotChecked=312, Total=3080 [2022-07-12 18:08:22,597 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1069 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 879 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:22,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1111 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1151 Invalid, 0 Unknown, 879 Unchecked, 0.6s Time] [2022-07-12 18:08:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-12 18:08:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 201. [2022-07-12 18:08:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.301775147928994) internal successors, (220), 200 states have internal predecessors, (220), 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) [2022-07-12 18:08:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2022-07-12 18:08:22,601 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 39 [2022-07-12 18:08:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:22,601 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2022-07-12 18:08:22,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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) [2022-07-12 18:08:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2022-07-12 18:08:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:08:22,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:22,601 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:22,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:22,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 18:08:22,819 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:22,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1519790839, now seen corresponding path program 1 times [2022-07-12 18:08:22,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:22,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157590051] [2022-07-12 18:08:22,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:22,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:22,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157590051] [2022-07-12 18:08:22,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157590051] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:22,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:22,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372985031] [2022-07-12 18:08:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:22,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:22,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:22,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:22,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:22,865 INFO L87 Difference]: Start difference. First operand 201 states and 220 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2022-07-12 18:08:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:22,870 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2022-07-12 18:08:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:22,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 40 [2022-07-12 18:08:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:22,871 INFO L225 Difference]: With dead ends: 202 [2022-07-12 18:08:22,871 INFO L226 Difference]: Without dead ends: 202 [2022-07-12 18:08:22,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:22,872 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:22,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:08:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-12 18:08:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-12 18:08:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 201 states have internal predecessors, (220), 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) [2022-07-12 18:08:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2022-07-12 18:08:22,877 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 40 [2022-07-12 18:08:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:22,877 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2022-07-12 18:08:22,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2022-07-12 18:08:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2022-07-12 18:08:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:08:22,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:22,880 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:22,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 18:08:22,881 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 231761564, now seen corresponding path program 1 times [2022-07-12 18:08:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:22,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308153994] [2022-07-12 18:08:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:22,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:23,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:23,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308153994] [2022-07-12 18:08:23,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308153994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:23,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084049841] [2022-07-12 18:08:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:23,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:23,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:23,207 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:23,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 18:08:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:23,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 18:08:23,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:23,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:23,326 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:23,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:08:23,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-12 18:08:23,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:08:23,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:23,456 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:23,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-12 18:08:23,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:23,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-12 18:08:23,516 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:23,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 63 [2022-07-12 18:08:23,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 13 [2022-07-12 18:08:23,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:08:23,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 9 [2022-07-12 18:08:23,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 17 [2022-07-12 18:08:23,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:08:24,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:24,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:24,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 10 [2022-07-12 18:08:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:25,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:25,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 60 [2022-07-12 18:08:27,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:27,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-07-12 18:08:27,199 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:27,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 41 [2022-07-12 18:08:27,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 11 [2022-07-12 18:08:27,459 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:08:27,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 1 [2022-07-12 18:08:27,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:27,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 18:08:27,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:27,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:27,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:27,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 18:08:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:29,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084049841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:29,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:29,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2022-07-12 18:08:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261023906] [2022-07-12 18:08:29,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:29,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 18:08:29,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:29,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 18:08:29,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 18:08:29,365 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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) [2022-07-12 18:08:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:32,359 INFO L93 Difference]: Finished difference Result 315 states and 338 transitions. [2022-07-12 18:08:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:08:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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 42 [2022-07-12 18:08:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:32,360 INFO L225 Difference]: With dead ends: 315 [2022-07-12 18:08:32,360 INFO L226 Difference]: Without dead ends: 315 [2022-07-12 18:08:32,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=419, Invalid=2887, Unknown=0, NotChecked=0, Total=3306 [2022-07-12 18:08:32,361 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 457 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:32,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2102 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1241 Invalid, 0 Unknown, 605 Unchecked, 1.3s Time] [2022-07-12 18:08:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-12 18:08:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 201. [2022-07-12 18:08:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 200 states have internal predecessors, (218), 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) [2022-07-12 18:08:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2022-07-12 18:08:32,364 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 42 [2022-07-12 18:08:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:32,365 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2022-07-12 18:08:32,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 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) [2022-07-12 18:08:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2022-07-12 18:08:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:08:32,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:32,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:32,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:32,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:32,566 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:32,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995560, now seen corresponding path program 1 times [2022-07-12 18:08:32,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:32,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970042138] [2022-07-12 18:08:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:32,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:32,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:32,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970042138] [2022-07-12 18:08:32,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970042138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:32,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214688636] [2022-07-12 18:08:32,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:32,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:32,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:32,800 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:32,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 18:08:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:32,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 18:08:32,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:32,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:33,055 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:08:33,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:33,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:08:33,195 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:33,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-12 18:08:33,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:33,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-12 18:08:33,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-12 18:08:33,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 17 [2022-07-12 18:08:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:33,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:33,579 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 18:08:33,602 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2022-07-12 18:08:33,608 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_681 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_681) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2022-07-12 18:08:33,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:33,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-07-12 18:08:33,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:33,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 36 [2022-07-12 18:08:33,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-07-12 18:08:33,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:33,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-12 18:08:33,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:33,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:33,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:08:33,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-12 18:08:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:33,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214688636] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:33,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:33,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-07-12 18:08:33,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148789081] [2022-07-12 18:08:33,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:33,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 18:08:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:33,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 18:08:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=539, Unknown=3, NotChecked=150, Total=812 [2022-07-12 18:08:33,759 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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) [2022-07-12 18:08:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:34,373 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2022-07-12 18:08:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:08:34,374 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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 44 [2022-07-12 18:08:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:34,375 INFO L225 Difference]: With dead ends: 248 [2022-07-12 18:08:34,375 INFO L226 Difference]: Without dead ends: 248 [2022-07-12 18:08:34,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=753, Unknown=3, NotChecked=180, Total=1122 [2022-07-12 18:08:34,376 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 376 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 591 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:34,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1160 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 849 Invalid, 0 Unknown, 591 Unchecked, 0.4s Time] [2022-07-12 18:08:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-12 18:08:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2022-07-12 18:08:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3125) internal successors, (252), 223 states have internal predecessors, (252), 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) [2022-07-12 18:08:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2022-07-12 18:08:34,384 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 44 [2022-07-12 18:08:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:34,384 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2022-07-12 18:08:34,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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) [2022-07-12 18:08:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2022-07-12 18:08:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:08:34,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:34,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:34,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:34,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:34,599 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:34,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:34,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995559, now seen corresponding path program 1 times [2022-07-12 18:08:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:34,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819853345] [2022-07-12 18:08:34,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:34,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:34,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819853345] [2022-07-12 18:08:34,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819853345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:34,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479258917] [2022-07-12 18:08:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:34,782 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:34,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 18:08:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:34,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-12 18:08:34,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:34,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:34,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:34,979 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:34,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:08:35,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:35,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:08:35,197 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:08:35,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 20 [2022-07-12 18:08:35,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:35,220 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:35,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-12 18:08:35,285 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:35,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-07-12 18:08:35,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:08:35,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-12 18:08:35,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:08:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:35,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:35,757 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 18:08:35,781 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 18:08:35,787 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_762) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_761) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 18:08:35,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:35,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2022-07-12 18:08:35,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:35,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-07-12 18:08:35,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:35,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 55 [2022-07-12 18:08:35,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:35,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 81 [2022-07-12 18:08:35,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 [2022-07-12 18:08:35,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 58 [2022-07-12 18:08:36,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:36,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 18:08:36,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:08:36,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 18:08:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:36,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479258917] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:36,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:36,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2022-07-12 18:08:36,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156644595] [2022-07-12 18:08:36,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:36,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 18:08:36,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:36,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 18:08:36,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=618, Unknown=3, NotChecked=156, Total=870 [2022-07-12 18:08:36,906 INFO L87 Difference]: Start difference. First operand 224 states and 252 transitions. Second operand has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:38,145 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2022-07-12 18:08:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:08:38,145 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-12 18:08:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:38,146 INFO L225 Difference]: With dead ends: 247 [2022-07-12 18:08:38,146 INFO L226 Difference]: Without dead ends: 247 [2022-07-12 18:08:38,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=293, Invalid=1198, Unknown=3, NotChecked=228, Total=1722 [2022-07-12 18:08:38,147 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 434 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:38,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1063 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 906 Invalid, 0 Unknown, 486 Unchecked, 0.7s Time] [2022-07-12 18:08:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-12 18:08:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2022-07-12 18:08:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 192 states have (on average 1.3072916666666667) internal successors, (251), 223 states have internal predecessors, (251), 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) [2022-07-12 18:08:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2022-07-12 18:08:38,150 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 44 [2022-07-12 18:08:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:38,150 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2022-07-12 18:08:38,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:08:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2022-07-12 18:08:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:08:38,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:38,151 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:38,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:38,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 18:08:38,359 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash -64101254, now seen corresponding path program 1 times [2022-07-12 18:08:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:38,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857741557] [2022-07-12 18:08:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:38,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 18:08:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:38,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857741557] [2022-07-12 18:08:38,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857741557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:38,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:38,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720058687] [2022-07-12 18:08:38,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:38,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:38,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:38,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:38,434 INFO L87 Difference]: Start difference. First operand 224 states and 251 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-07-12 18:08:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:38,467 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-07-12 18:08:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 44 [2022-07-12 18:08:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:38,468 INFO L225 Difference]: With dead ends: 298 [2022-07-12 18:08:38,468 INFO L226 Difference]: Without dead ends: 298 [2022-07-12 18:08:38,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:38,469 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:38,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 282 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:08:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-12 18:08:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2022-07-12 18:08:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 241 states have internal predecessors, (270), 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) [2022-07-12 18:08:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-07-12 18:08:38,473 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 44 [2022-07-12 18:08:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:38,473 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-07-12 18:08:38,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-07-12 18:08:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-07-12 18:08:38,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:08:38,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:38,474 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:38,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 18:08:38,474 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2014223229, now seen corresponding path program 1 times [2022-07-12 18:08:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:38,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007611753] [2022-07-12 18:08:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:38,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:38,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007611753] [2022-07-12 18:08:38,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007611753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:38,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094602168] [2022-07-12 18:08:38,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:38,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:38,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:38,579 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:38,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 18:08:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:38,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:08:38,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:38,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 17 [2022-07-12 18:08:38,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 13 [2022-07-12 18:08:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:38,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:08:38,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094602168] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:38,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:38,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-12 18:08:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016777843] [2022-07-12 18:08:38,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:38,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:08:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:08:38,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:08:38,932 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-07-12 18:08:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:39,044 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2022-07-12 18:08:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:08:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 45 [2022-07-12 18:08:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:39,045 INFO L225 Difference]: With dead ends: 283 [2022-07-12 18:08:39,045 INFO L226 Difference]: Without dead ends: 275 [2022-07-12 18:08:39,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:08:39,046 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 192 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:39,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 349 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:08:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-12 18:08:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2022-07-12 18:08:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 237 states have (on average 1.2827004219409284) internal successors, (304), 268 states have internal predecessors, (304), 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) [2022-07-12 18:08:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2022-07-12 18:08:39,050 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 45 [2022-07-12 18:08:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:39,050 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2022-07-12 18:08:39,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-07-12 18:08:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2022-07-12 18:08:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:08:39,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:39,051 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:39,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 18:08:39,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:39,252 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash 164743237, now seen corresponding path program 1 times [2022-07-12 18:08:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:39,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159007809] [2022-07-12 18:08:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:39,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:39,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159007809] [2022-07-12 18:08:39,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159007809] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:39,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159328199] [2022-07-12 18:08:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:39,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:39,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:39,615 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:39,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 18:08:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:39,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 18:08:39,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:39,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:39,840 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:39,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-12 18:08:39,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:08:40,017 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:40,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 28 [2022-07-12 18:08:40,037 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:40,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 28 [2022-07-12 18:08:40,114 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:40,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:08:40,162 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:08:40,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-12 18:08:40,299 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 18:08:40,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2022-07-12 18:08:40,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-12 18:08:40,424 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 18:08:40,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2022-07-12 18:08:40,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-07-12 18:08:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:40,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:40,549 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 18:08:40,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 18:08:40,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 18:08:40,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 18:08:40,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:40,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 21 [2022-07-12 18:08:40,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-07-12 18:08:40,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-12 18:08:40,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_68| Int) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1003 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_14 |v_ULTIMATE.start_main_~item~0#1.offset_68|))) (or (not (= 0 (select |c_#valid| .cse0))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_14) .cse0 v_ArrVal_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-07-12 18:08:40,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:40,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-07-12 18:08:40,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:40,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 76 [2022-07-12 18:08:40,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:40,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 65 [2022-07-12 18:08:40,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-07-12 18:08:40,761 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:08:40,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 [2022-07-12 18:08:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 18:08:40,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159328199] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:40,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:40,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-07-12 18:08:40,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323521591] [2022-07-12 18:08:40,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:40,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 18:08:40,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:40,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 18:08:40,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=925, Unknown=7, NotChecked=476, Total=1560 [2022-07-12 18:08:40,912 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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) [2022-07-12 18:08:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:41,988 INFO L93 Difference]: Finished difference Result 336 states and 377 transitions. [2022-07-12 18:08:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 18:08:41,996 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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 45 [2022-07-12 18:08:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:41,997 INFO L225 Difference]: With dead ends: 336 [2022-07-12 18:08:41,997 INFO L226 Difference]: Without dead ends: 336 [2022-07-12 18:08:41,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=396, Invalid=1881, Unknown=7, NotChecked=686, Total=2970 [2022-07-12 18:08:41,998 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 385 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1233 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:41,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1431 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 967 Invalid, 0 Unknown, 1233 Unchecked, 0.4s Time] [2022-07-12 18:08:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-12 18:08:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 292. [2022-07-12 18:08:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 260 states have (on average 1.2615384615384615) internal successors, (328), 291 states have internal predecessors, (328), 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) [2022-07-12 18:08:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2022-07-12 18:08:42,001 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 45 [2022-07-12 18:08:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:42,001 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2022-07-12 18:08:42,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 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) [2022-07-12 18:08:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2022-07-12 18:08:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:08:42,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:42,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:42,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:42,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 18:08:42,222 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:42,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1983636472, now seen corresponding path program 1 times [2022-07-12 18:08:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:42,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99263674] [2022-07-12 18:08:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:08:42,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99263674] [2022-07-12 18:08:42,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99263674] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:08:42,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472630230] [2022-07-12 18:08:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:08:42,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:42,412 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:08:42,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 18:08:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:42,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 18:08:42,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:42,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:42,607 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:08:42,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:08:42,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:08:42,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:42,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2022-07-12 18:08:42,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-12 18:08:42,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-12 18:08:42,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:08:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:42,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:08:44,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-12 18:08:44,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-12 18:08:44,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1080 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1080) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) is different from false [2022-07-12 18:08:44,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:44,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 18:08:45,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:08:45,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 18:08:45,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-12 18:08:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:45,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472630230] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:08:45,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:08:45,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2022-07-12 18:08:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816578624] [2022-07-12 18:08:45,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:08:45,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 18:08:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:08:45,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 18:08:45,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=385, Unknown=3, NotChecked=126, Total=600 [2022-07-12 18:08:45,089 INFO L87 Difference]: Start difference. First operand 292 states and 328 transitions. Second operand has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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) [2022-07-12 18:08:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:45,665 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2022-07-12 18:08:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:08:45,666 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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 46 [2022-07-12 18:08:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:45,667 INFO L225 Difference]: With dead ends: 301 [2022-07-12 18:08:45,667 INFO L226 Difference]: Without dead ends: 301 [2022-07-12 18:08:45,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=828, Unknown=3, NotChecked=192, Total=1260 [2022-07-12 18:08:45,672 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 409 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:45,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1193 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 753 Invalid, 0 Unknown, 512 Unchecked, 0.4s Time] [2022-07-12 18:08:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-12 18:08:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 294. [2022-07-12 18:08:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 262 states have (on average 1.2595419847328244) internal successors, (330), 293 states have internal predecessors, (330), 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) [2022-07-12 18:08:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 330 transitions. [2022-07-12 18:08:45,682 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 330 transitions. Word has length 46 [2022-07-12 18:08:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:45,682 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 330 transitions. [2022-07-12 18:08:45,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 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) [2022-07-12 18:08:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 330 transitions. [2022-07-12 18:08:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 18:08:45,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:45,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:45,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:45,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 18:08:45,900 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:45,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:45,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1363188935, now seen corresponding path program 1 times [2022-07-12 18:08:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:08:45,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109565633] [2022-07-12 18:08:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:08:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:46,061 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2022-07-12 18:08:46,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 18:08:46,089 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-07-12 18:08:46,111 INFO L158 Benchmark]: Toolchain (without parser) took 38100.86ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 61.3MB in the beginning and 104.7MB in the end (delta: -43.4MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2022-07-12 18:08:46,111 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 94.4MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:08:46,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.69ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.1MB in the beginning and 78.8MB in the end (delta: -17.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 18:08:46,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.55ms. Allocated memory is still 113.2MB. Free memory was 78.8MB in the beginning and 76.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:08:46,112 INFO L158 Benchmark]: Boogie Preprocessor took 34.86ms. Allocated memory is still 113.2MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:08:46,112 INFO L158 Benchmark]: RCFGBuilder took 403.45ms. Allocated memory is still 113.2MB. Free memory was 74.3MB in the beginning and 78.3MB in the end (delta: -4.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-07-12 18:08:46,112 INFO L158 Benchmark]: TraceAbstraction took 37272.13ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 77.7MB in the beginning and 104.7MB in the end (delta: -27.0MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-07-12 18:08:46,117 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 94.4MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.69ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 61.1MB in the beginning and 78.8MB in the end (delta: -17.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.55ms. Allocated memory is still 113.2MB. Free memory was 78.8MB in the beginning and 76.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.86ms. Allocated memory is still 113.2MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.45ms. Allocated memory is still 113.2MB. Free memory was 74.3MB in the beginning and 78.3MB in the end (delta: -4.0MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 37272.13ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 77.7MB in the beginning and 104.7MB in the end (delta: -27.0MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 18:08:46,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:08:48,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:08:48,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:08:49,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:08:49,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:08:49,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:08:49,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:08:49,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:08:49,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:08:49,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:08:49,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:08:49,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:08:49,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:08:49,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:08:49,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:08:49,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:08:49,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:08:49,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:08:49,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:08:49,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:08:49,069 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:08:49,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:08:49,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:08:49,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:08:49,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:08:49,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:08:49,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:08:49,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:08:49,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:08:49,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:08:49,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:08:49,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:08:49,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:08:49,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:08:49,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:08:49,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:08:49,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:08:49,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:08:49,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:08:49,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:08:49,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:08:49,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:08:49,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-07-12 18:08:49,144 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:08:49,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:08:49,145 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:08:49,145 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:08:49,145 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:08:49,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:08:49,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:08:49,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:08:49,147 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:08:49,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:08:49,148 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:08:49,148 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:08:49,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:08:49,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:08:49,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:08:49,148 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:08:49,148 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:08:49,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:08:49,149 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:08:49,149 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:08:49,149 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:08:49,149 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:08:49,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:08:49,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:08:49,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:08:49,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:08:49,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:08:49,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:08:49,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:08:49,150 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:08:49,151 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:08:49,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:08:49,151 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 valid-memcleanup) ) 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 -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2022-07-12 18:08:49,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:08:49,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:08:49,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:08:49,598 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:08:49,600 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:08:49,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-12 18:08:49,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fad26d8b/055d0a0d3f71478da7c2c0bd7279be8a/FLAG8f2dbae98 [2022-07-12 18:08:50,297 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:08:50,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-12 18:08:50,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fad26d8b/055d0a0d3f71478da7c2c0bd7279be8a/FLAG8f2dbae98 [2022-07-12 18:08:50,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fad26d8b/055d0a0d3f71478da7c2c0bd7279be8a [2022-07-12 18:08:50,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:08:50,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:08:50,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:08:50,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:08:50,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:08:50,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:08:50" (1/1) ... [2022-07-12 18:08:50,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c45ee0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:50, skipping insertion in model container [2022-07-12 18:08:50,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:08:50" (1/1) ... [2022-07-12 18:08:50,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:08:50,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:08:51,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-07-12 18:08:51,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-07-12 18:08:51,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-07-12 18:08:51,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-07-12 18:08:51,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-07-12 18:08:51,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-07-12 18:08:51,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-07-12 18:08:51,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-07-12 18:08:51,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-07-12 18:08:51,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-07-12 18:08:51,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-07-12 18:08:51,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-07-12 18:08:51,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-07-12 18:08:51,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-07-12 18:08:51,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:08:51,163 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:08:51,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-07-12 18:08:51,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-07-12 18:08:51,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-07-12 18:08:51,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-07-12 18:08:51,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-07-12 18:08:51,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-07-12 18:08:51,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-07-12 18:08:51,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-07-12 18:08:51,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-07-12 18:08:51,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-07-12 18:08:51,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-07-12 18:08:51,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-07-12 18:08:51,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-07-12 18:08:51,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-07-12 18:08:51,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:08:51,225 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:08:51,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51 WrapperNode [2022-07-12 18:08:51,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:08:51,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:08:51,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:08:51,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:08:51,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,260 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-07-12 18:08:51,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:08:51,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:08:51,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:08:51,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:08:51,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:08:51,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:08:51,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:08:51,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:08:51,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (1/1) ... [2022-07-12 18:08:51,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:08:51,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:08:51,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:08:51,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:08:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 18:08:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:08:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:08:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:08:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:08:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:08:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 18:08:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 18:08:51,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:08:51,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:08:51,582 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:08:51,583 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:08:52,350 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:08:52,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:08:52,355 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-12 18:08:52,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:08:52 BoogieIcfgContainer [2022-07-12 18:08:52,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:08:52,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:08:52,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:08:52,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:08:52,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:08:50" (1/3) ... [2022-07-12 18:08:52,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2c706b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:08:52, skipping insertion in model container [2022-07-12 18:08:52,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:08:51" (2/3) ... [2022-07-12 18:08:52,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2c706b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:08:52, skipping insertion in model container [2022-07-12 18:08:52,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:08:52" (3/3) ... [2022-07-12 18:08:52,362 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2022-07-12 18:08:52,372 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:08:52,372 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-12 18:08:52,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:08:52,417 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6286bbae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8e52a2f [2022-07-12 18:08:52,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-12 18:08:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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) [2022-07-12 18:08:52,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:08:52,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:52,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:08:52,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:08:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:08:52,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507124068] [2022-07-12 18:08:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:52,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:08:52,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:08:52,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:08:52,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:08:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:52,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:08:52,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:52,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:52,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:08:52,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:08:52,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507124068] [2022-07-12 18:08:52,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507124068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:52,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:52,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:08:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601711395] [2022-07-12 18:08:52,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:52,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:08:52,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:52,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:52,774 INFO L87 Difference]: Start difference. First operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:08:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:53,029 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2022-07-12 18:08:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:53,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-12 18:08:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:53,040 INFO L225 Difference]: With dead ends: 166 [2022-07-12 18:08:53,040 INFO L226 Difference]: Without dead ends: 162 [2022-07-12 18:08:53,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:53,047 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 156 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:53,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 105 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-12 18:08:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-07-12 18:08:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 157 states have internal predecessors, (169), 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) [2022-07-12 18:08:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2022-07-12 18:08:53,099 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 3 [2022-07-12 18:08:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:53,100 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2022-07-12 18:08:53,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:08:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-07-12 18:08:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:08:53,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:53,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:08:53,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:53,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:08:53,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:08:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:08:53,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421241382] [2022-07-12 18:08:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:53,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:08:53,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:08:53,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:08:53,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:08:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:53,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:08:53,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:53,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:53,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:08:53,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:08:53,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421241382] [2022-07-12 18:08:53,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421241382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:53,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:53,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:08:53,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140581333] [2022-07-12 18:08:53,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:53,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:53,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:08:53,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:53,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:53,464 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:08:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:53,724 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2022-07-12 18:08:53,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:53,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-12 18:08:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:53,726 INFO L225 Difference]: With dead ends: 152 [2022-07-12 18:08:53,726 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 18:08:53,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:53,727 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:53,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 108 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 18:08:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-07-12 18:08:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.6122448979591837) internal successors, (158), 147 states have internal predecessors, (158), 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) [2022-07-12 18:08:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-07-12 18:08:53,732 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 3 [2022-07-12 18:08:53,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:53,732 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-07-12 18:08:53,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-12 18:08:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-07-12 18:08:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:08:53,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:53,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:53,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:53,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:08:53,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2022-07-12 18:08:53,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:08:53,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82432762] [2022-07-12 18:08:53,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:53,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:08:53,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:08:53,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:08:53,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:08:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:54,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:08:54,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:54,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:54,096 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 18:08:54,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 17 [2022-07-12 18:08:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:54,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:08:54,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:08:54,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82432762] [2022-07-12 18:08:54,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82432762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:54,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:54,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331121180] [2022-07-12 18:08:54,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:54,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:08:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:08:54,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:08:54,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:08:54,114 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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) [2022-07-12 18:08:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:54,372 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2022-07-12 18:08:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:08:54,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 [2022-07-12 18:08:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:54,373 INFO L225 Difference]: With dead ends: 158 [2022-07-12 18:08:54,373 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 18:08:54,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:08:54,374 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 256 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:54,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 108 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:08:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 18:08:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2022-07-12 18:08:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.561904761904762) internal successors, (164), 149 states have internal predecessors, (164), 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) [2022-07-12 18:08:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2022-07-12 18:08:54,385 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 7 [2022-07-12 18:08:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:54,385 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2022-07-12 18:08:54,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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) [2022-07-12 18:08:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2022-07-12 18:08:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:08:54,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:54,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:54,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 18:08:54,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:08:54,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2022-07-12 18:08:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:08:54,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226834096] [2022-07-12 18:08:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:54,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:08:54,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:08:54,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:08:54,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:08:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:54,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:08:54,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:54,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:54,801 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:08:54,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-12 18:08:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:54,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:08:54,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:08:54,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226834096] [2022-07-12 18:08:54,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226834096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:54,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:54,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556020197] [2022-07-12 18:08:54,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:54,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:08:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:08:54,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:08:54,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:08:54,819 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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) [2022-07-12 18:08:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:55,115 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2022-07-12 18:08:55,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:08:55,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 [2022-07-12 18:08:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:55,129 INFO L225 Difference]: With dead ends: 240 [2022-07-12 18:08:55,129 INFO L226 Difference]: Without dead ends: 240 [2022-07-12 18:08:55,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:08:55,130 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 313 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:55,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 175 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:08:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-12 18:08:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 154. [2022-07-12 18:08:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 153 states have internal predecessors, (168), 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) [2022-07-12 18:08:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2022-07-12 18:08:55,145 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 7 [2022-07-12 18:08:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:55,146 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2022-07-12 18:08:55,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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) [2022-07-12 18:08:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2022-07-12 18:08:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:08:55,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:55,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:55,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:55,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:08:55,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:55,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash 59268142, now seen corresponding path program 1 times [2022-07-12 18:08:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:08:55,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010516794] [2022-07-12 18:08:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:55,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:08:55,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:08:55,357 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:08:55,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:08:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:55,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:08:55,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:55,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:08:55,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:08:55,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010516794] [2022-07-12 18:08:55,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010516794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:55,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:55,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:08:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427535240] [2022-07-12 18:08:55,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:55,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:08:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:08:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:08:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:55,942 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-07-12 18:08:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:57,290 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2022-07-12 18:08:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:08:57,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-07-12 18:08:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:57,302 INFO L225 Difference]: With dead ends: 144 [2022-07-12 18:08:57,302 INFO L226 Difference]: Without dead ends: 144 [2022-07-12 18:08:57,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:08:57,312 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 122 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:57,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 131 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 18:08:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-12 18:08:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-07-12 18:08:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 143 states have internal predecessors, (157), 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) [2022-07-12 18:08:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2022-07-12 18:08:57,330 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 8 [2022-07-12 18:08:57,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:57,330 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2022-07-12 18:08:57,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-07-12 18:08:57,330 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2022-07-12 18:08:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:08:57,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:57,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:57,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:57,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:08:57,540 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:57,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-07-12 18:08:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:08:57,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750174867] [2022-07-12 18:08:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:57,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:08:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:08:57,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:08:57,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:08:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:57,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:08:57,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:57,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:57,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:57,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-12 18:08:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:57,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:08:57,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:08:57,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750174867] [2022-07-12 18:08:57,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750174867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:57,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:57,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:08:57,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904576582] [2022-07-12 18:08:57,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:57,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:57,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:08:57,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:57,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:57,725 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-07-12 18:08:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:58,389 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2022-07-12 18:08:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:08:58,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2022-07-12 18:08:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:58,391 INFO L225 Difference]: With dead ends: 215 [2022-07-12 18:08:58,391 INFO L226 Difference]: Without dead ends: 215 [2022-07-12 18:08:58,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:08:58,392 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 109 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:58,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 656 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:08:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-12 18:08:58,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2022-07-12 18:08:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.5) internal successors, (156), 142 states have internal predecessors, (156), 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) [2022-07-12 18:08:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2022-07-12 18:08:58,396 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 11 [2022-07-12 18:08:58,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:58,396 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2022-07-12 18:08:58,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-07-12 18:08:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2022-07-12 18:08:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:08:58,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:58,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:58,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:58,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:08:58,611 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-07-12 18:08:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:08:58,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136714329] [2022-07-12 18:08:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:58,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:08:58,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:08:58,616 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:08:58,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:08:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:58,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:08:58,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:08:58,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:58,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:58,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:08:59,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-12 18:08:59,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:08:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:08:59,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:08:59,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:08:59,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136714329] [2022-07-12 18:08:59,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136714329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:08:59,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:08:59,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:08:59,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342726903] [2022-07-12 18:08:59,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:08:59,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:08:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:08:59,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:08:59,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:08:59,126 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-07-12 18:08:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:08:59,586 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2022-07-12 18:08:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:08:59,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2022-07-12 18:08:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:08:59,587 INFO L225 Difference]: With dead ends: 207 [2022-07-12 18:08:59,587 INFO L226 Difference]: Without dead ends: 207 [2022-07-12 18:08:59,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:08:59,588 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 96 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:08:59,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 650 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:08:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-12 18:08:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2022-07-12 18:08:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.45) internal successors, (145), 132 states have internal predecessors, (145), 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) [2022-07-12 18:08:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-12 18:08:59,591 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2022-07-12 18:08:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:08:59,591 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-12 18:08:59,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-07-12 18:08:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-12 18:08:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:08:59,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:08:59,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:08:59,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:08:59,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:08:59,795 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:08:59,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:08:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1469737219, now seen corresponding path program 1 times [2022-07-12 18:08:59,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:08:59,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332104513] [2022-07-12 18:08:59,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:08:59,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:08:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:08:59,801 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:08:59,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:08:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:08:59,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:08:59,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:00,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:00,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:00,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332104513] [2022-07-12 18:09:00,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332104513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:00,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:00,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:09:00,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249113168] [2022-07-12 18:09:00,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:00,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:09:00,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:00,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:09:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:00,210 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-12 18:09:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:00,245 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-07-12 18:09:00,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:09:00,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-07-12 18:09:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:00,246 INFO L225 Difference]: With dead ends: 185 [2022-07-12 18:09:00,246 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 18:09:00,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:00,247 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:00,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 18:09:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2022-07-12 18:09:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 144 states have internal predecessors, (158), 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) [2022-07-12 18:09:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2022-07-12 18:09:00,251 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 14 [2022-07-12 18:09:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:00,251 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2022-07-12 18:09:00,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-07-12 18:09:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2022-07-12 18:09:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:09:00,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:00,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:00,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:00,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:00,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash -529144660, now seen corresponding path program 1 times [2022-07-12 18:09:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:00,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823742611] [2022-07-12 18:09:00,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:00,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:00,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:00,468 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:00,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:09:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:00,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:09:00,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:00,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:00,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:00,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823742611] [2022-07-12 18:09:00,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823742611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:00,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:00,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:09:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636196674] [2022-07-12 18:09:00,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:00,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:09:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:00,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:09:00,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:09:00,866 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 4 states, 4 states have (on average 4.25) 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) [2022-07-12 18:09:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:00,898 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-07-12 18:09:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:09:00,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) 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 17 [2022-07-12 18:09:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:00,899 INFO L225 Difference]: With dead ends: 176 [2022-07-12 18:09:00,899 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 18:09:00,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:09:00,900 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 31 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:00,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 18:09:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2022-07-12 18:09:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.396694214876033) internal successors, (169), 153 states have internal predecessors, (169), 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) [2022-07-12 18:09:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2022-07-12 18:09:00,903 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 17 [2022-07-12 18:09:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:00,903 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2022-07-12 18:09:00,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) 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) [2022-07-12 18:09:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2022-07-12 18:09:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:09:00,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:00,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:00,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:01,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:01,111 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash 271532674, now seen corresponding path program 1 times [2022-07-12 18:09:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:01,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943350821] [2022-07-12 18:09:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:01,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:01,113 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:01,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 18:09:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:01,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:09:01,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:01,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:09:01,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2022-07-12 18:09:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:01,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:01,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:01,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943350821] [2022-07-12 18:09:01,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943350821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:01,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:01,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:09:01,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685704634] [2022-07-12 18:09:01,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:01,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:09:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:01,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:09:01,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:09:01,392 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-07-12 18:09:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:01,592 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2022-07-12 18:09:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:09:01,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 [2022-07-12 18:09:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:01,593 INFO L225 Difference]: With dead ends: 152 [2022-07-12 18:09:01,594 INFO L226 Difference]: Without dead ends: 152 [2022-07-12 18:09:01,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:09:01,594 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 89 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:01,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 515 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:09:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-12 18:09:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-12 18:09:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 151 states have internal predecessors, (167), 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) [2022-07-12 18:09:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-07-12 18:09:01,597 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 18 [2022-07-12 18:09:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:01,597 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-07-12 18:09:01,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-07-12 18:09:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-07-12 18:09:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:09:01,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:01,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:01,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-12 18:09:01,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:01,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1721073736, now seen corresponding path program 1 times [2022-07-12 18:09:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:01,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327543549] [2022-07-12 18:09:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:01,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:01,804 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:01,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 18:09:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:01,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:09:01,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:02,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:02,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:02,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327543549] [2022-07-12 18:09:02,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327543549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:02,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:02,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:09:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290953187] [2022-07-12 18:09:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:02,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:09:02,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:02,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:09:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:09:02,021 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-07-12 18:09:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:02,225 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-12 18:09:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:09:02,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2022-07-12 18:09:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:02,226 INFO L225 Difference]: With dead ends: 156 [2022-07-12 18:09:02,226 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 18:09:02,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:09:02,227 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 262 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:02,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 201 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:09:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 18:09:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-12 18:09:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 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) [2022-07-12 18:09:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-12 18:09:02,229 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 19 [2022-07-12 18:09:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:02,230 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-12 18:09:02,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-07-12 18:09:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-12 18:09:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:09:02,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:02,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:02,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:02,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:02,439 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1701915074, now seen corresponding path program 1 times [2022-07-12 18:09:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:02,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155138915] [2022-07-12 18:09:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:02,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:02,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:02,444 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:02,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 18:09:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:02,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:09:02,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:02,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:02,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:02,631 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:09:02,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-07-12 18:09:02,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:02,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-07-12 18:09:02,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:09:02,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:09:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:02,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:02,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:02,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155138915] [2022-07-12 18:09:02,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155138915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:02,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:02,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:09:02,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554131138] [2022-07-12 18:09:02,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:02,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:09:02,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:02,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:09:02,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:09:02,738 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-07-12 18:09:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:03,183 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-07-12 18:09:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:09:03,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-07-12 18:09:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:03,185 INFO L225 Difference]: With dead ends: 149 [2022-07-12 18:09:03,185 INFO L226 Difference]: Without dead ends: 149 [2022-07-12 18:09:03,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:09:03,187 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:03,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:09:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-12 18:09:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2022-07-12 18:09:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 145 states have internal predecessors, (157), 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) [2022-07-12 18:09:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2022-07-12 18:09:03,199 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 19 [2022-07-12 18:09:03,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:03,202 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2022-07-12 18:09:03,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2022-07-12 18:09:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2022-07-12 18:09:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:09:03,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:03,205 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:03,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:03,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:03,412 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:03,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash 812348068, now seen corresponding path program 1 times [2022-07-12 18:09:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:03,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373828349] [2022-07-12 18:09:03,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:03,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:03,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:03,422 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:03,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 18:09:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:03,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:09:03,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:03,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:03,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:03,636 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:09:03,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-07-12 18:09:03,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:03,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-07-12 18:09:03,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:09:03,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:09:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:03,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:03,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:03,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373828349] [2022-07-12 18:09:03,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373828349] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:03,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:03,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-12 18:09:03,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349175370] [2022-07-12 18:09:03,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:03,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:09:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:03,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:09:03,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:09:03,824 INFO L87 Difference]: Start difference. First operand 146 states and 157 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) [2022-07-12 18:09:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:03,966 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-12 18:09:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:09:03,967 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 [2022-07-12 18:09:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:03,968 INFO L225 Difference]: With dead ends: 153 [2022-07-12 18:09:03,968 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 18:09:03,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:09:03,969 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:03,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 443 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:09:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 18:09:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-12 18:09:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 152 states have internal predecessors, (164), 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) [2022-07-12 18:09:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-12 18:09:03,972 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 22 [2022-07-12 18:09:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:03,972 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-12 18:09:03,972 INFO L496 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) [2022-07-12 18:09:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-12 18:09:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:09:03,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:03,973 INFO L195 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, 1] [2022-07-12 18:09:03,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:04,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:04,174 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:04,174 INFO L85 PathProgramCache]: Analyzing trace with hash -587014801, now seen corresponding path program 1 times [2022-07-12 18:09:04,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:04,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913756224] [2022-07-12 18:09:04,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:04,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:04,176 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:04,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 18:09:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:04,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:09:04,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:04,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:04,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:04,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913756224] [2022-07-12 18:09:04,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913756224] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:04,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:04,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-12 18:09:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183240491] [2022-07-12 18:09:04,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:04,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:09:04,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:04,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:09:04,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:09:04,449 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 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) [2022-07-12 18:09:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:04,702 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-12 18:09:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:09:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 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) Word has length 23 [2022-07-12 18:09:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:04,704 INFO L225 Difference]: With dead ends: 155 [2022-07-12 18:09:04,704 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 18:09:04,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:09:04,705 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:04,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-12 18:09:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 18:09:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-07-12 18:09:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 137 states have internal predecessors, (148), 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) [2022-07-12 18:09:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2022-07-12 18:09:04,717 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 23 [2022-07-12 18:09:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:04,718 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2022-07-12 18:09:04,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 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) [2022-07-12 18:09:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2022-07-12 18:09:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:09:04,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:04,718 INFO L195 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, 1, 1, 1, 1, 1] [2022-07-12 18:09:04,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:04,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:04,919 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1469175391, now seen corresponding path program 1 times [2022-07-12 18:09:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:04,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526687092] [2022-07-12 18:09:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:04,922 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:04,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 18:09:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:05,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:09:05,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:05,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:05,072 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:05,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-12 18:09:05,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:09:05,255 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:05,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 28 [2022-07-12 18:09:05,281 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:05,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 28 [2022-07-12 18:09:05,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-07-12 18:09:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:05,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:05,448 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 18:09:05,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 18:09:05,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 18:09:05,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:05,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 20 [2022-07-12 18:09:05,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:05,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 36 [2022-07-12 18:09:05,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-07-12 18:09:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:05,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:05,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526687092] [2022-07-12 18:09:05,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526687092] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:05,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:05,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-12 18:09:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279092143] [2022-07-12 18:09:05,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:05,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:09:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:05,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:09:05,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2022-07-12 18:09:05,644 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 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) [2022-07-12 18:09:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:06,539 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2022-07-12 18:09:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:09:06,539 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 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) Word has length 27 [2022-07-12 18:09:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:06,540 INFO L225 Difference]: With dead ends: 238 [2022-07-12 18:09:06,540 INFO L226 Difference]: Without dead ends: 238 [2022-07-12 18:09:06,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=282, Unknown=3, NotChecked=114, Total=506 [2022-07-12 18:09:06,541 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 392 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:06,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 614 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 454 Unchecked, 0.7s Time] [2022-07-12 18:09:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-12 18:09:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2022-07-12 18:09:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 151 states have internal predecessors, (164), 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) [2022-07-12 18:09:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-07-12 18:09:06,545 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 27 [2022-07-12 18:09:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:06,545 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-07-12 18:09:06,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 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) [2022-07-12 18:09:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-07-12 18:09:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:09:06,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:06,546 INFO L195 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, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:06,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:06,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:06,746 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash -442882051, now seen corresponding path program 1 times [2022-07-12 18:09:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21739020] [2022-07-12 18:09:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:06,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:06,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:06,749 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:06,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 18:09:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:06,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:09:06,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:06,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:06,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:06,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21739020] [2022-07-12 18:09:06,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21739020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:06,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:06,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:09:06,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970970091] [2022-07-12 18:09:06,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:06,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:09:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:06,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:09:06,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:06,848 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:06,874 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2022-07-12 18:09:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:09:06,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 18:09:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:06,875 INFO L225 Difference]: With dead ends: 209 [2022-07-12 18:09:06,875 INFO L226 Difference]: Without dead ends: 209 [2022-07-12 18:09:06,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:06,876 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 52 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:06,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 236 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-12 18:09:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 169. [2022-07-12 18:09:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 168 states have internal predecessors, (181), 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) [2022-07-12 18:09:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2022-07-12 18:09:06,879 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 28 [2022-07-12 18:09:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:06,880 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2022-07-12 18:09:06,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-07-12 18:09:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:09:06,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:06,880 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:06,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:07,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:07,092 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:07,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:07,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549191, now seen corresponding path program 1 times [2022-07-12 18:09:07,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:07,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138931951] [2022-07-12 18:09:07,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:07,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:07,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:07,112 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:07,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 18:09:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:07,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:09:07,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:07,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:07,291 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 18:09:07,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-12 18:09:07,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:09:07,442 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:07,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-12 18:09:07,480 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:07,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-12 18:09:07,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-12 18:09:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:07,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:07,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 18:09:07,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 18:09:07,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 18:09:07,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:07,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2022-07-12 18:09:07,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:07,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2022-07-12 18:09:07,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-12 18:09:19,315 WARN L233 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:09:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:25,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:25,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138931951] [2022-07-12 18:09:25,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138931951] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:25,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:25,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-12 18:09:25,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853985215] [2022-07-12 18:09:25,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:25,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:09:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:25,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:09:25,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=206, Unknown=5, NotChecked=96, Total=380 [2022-07-12 18:09:25,632 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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) [2022-07-12 18:09:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:26,076 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-07-12 18:09:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:09:26,076 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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 35 [2022-07-12 18:09:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:26,077 INFO L225 Difference]: With dead ends: 216 [2022-07-12 18:09:26,078 INFO L226 Difference]: Without dead ends: 216 [2022-07-12 18:09:26,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=118, Invalid=309, Unknown=5, NotChecked=120, Total=552 [2022-07-12 18:09:26,078 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 244 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:26,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 965 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 598 Unchecked, 0.3s Time] [2022-07-12 18:09:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-12 18:09:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2022-07-12 18:09:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 178 states have internal predecessors, (194), 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) [2022-07-12 18:09:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2022-07-12 18:09:26,082 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 35 [2022-07-12 18:09:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:26,082 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2022-07-12 18:09:26,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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) [2022-07-12 18:09:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2022-07-12 18:09:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:09:26,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:26,082 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:26,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:26,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:26,290 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549192, now seen corresponding path program 1 times [2022-07-12 18:09:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:26,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250982060] [2022-07-12 18:09:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:26,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:26,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:26,299 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:26,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 18:09:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:26,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 18:09:26,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:26,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:26,438 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:26,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:09:26,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-12 18:09:26,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:26,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:09:26,548 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:26,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-12 18:09:26,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:26,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-12 18:09:26,596 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:26,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-07-12 18:09:26,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:09:26,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-12 18:09:26,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:09:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:26,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:27,089 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 18:09:27,140 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-07-12 18:09:27,159 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2022-07-12 18:09:27,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:27,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 30 [2022-07-12 18:09:27,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:27,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-07-12 18:09:27,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-12 18:09:27,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:27,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2022-07-12 18:09:27,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:27,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-12 18:09:27,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:09:27,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-07-12 18:09:27,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:09:27,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 18:09:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:27,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:27,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250982060] [2022-07-12 18:09:27,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250982060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:27,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:27,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-12 18:09:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958137102] [2022-07-12 18:09:27,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:27,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 18:09:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 18:09:27,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-12 18:09:27,356 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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) [2022-07-12 18:09:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:29,151 INFO L93 Difference]: Finished difference Result 303 states and 324 transitions. [2022-07-12 18:09:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:09:29,151 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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 35 [2022-07-12 18:09:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:29,152 INFO L225 Difference]: With dead ends: 303 [2022-07-12 18:09:29,153 INFO L226 Difference]: Without dead ends: 303 [2022-07-12 18:09:29,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=610, Unknown=3, NotChecked=162, Total=930 [2022-07-12 18:09:29,153 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 395 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:29,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 636 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 711 Unchecked, 1.1s Time] [2022-07-12 18:09:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-12 18:09:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 183. [2022-07-12 18:09:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 182 states have internal predecessors, (198), 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) [2022-07-12 18:09:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2022-07-12 18:09:29,156 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 35 [2022-07-12 18:09:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:29,157 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2022-07-12 18:09:29,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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) [2022-07-12 18:09:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2022-07-12 18:09:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:09:29,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:29,157 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:29,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-12 18:09:29,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:29,364 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:29,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:29,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065939, now seen corresponding path program 1 times [2022-07-12 18:09:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:29,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048039603] [2022-07-12 18:09:29,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:29,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:29,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:29,367 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:29,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 18:09:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:29,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:09:29,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:29,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:29,538 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:29,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:09:29,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:09:29,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:29,668 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:29,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 18:09:29,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:29,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 21 [2022-07-12 18:09:29,703 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:29,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 51 [2022-07-12 18:09:29,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 17 [2022-07-12 18:09:29,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 [2022-07-12 18:09:29,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 21 [2022-07-12 18:09:29,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-12 18:09:29,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:09:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:29,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:30,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 77 treesize of output 57 [2022-07-12 18:09:30,090 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 18:09:30,109 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.offset|)) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 18:09:30,118 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0)))) is different from false [2022-07-12 18:09:30,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:30,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 18:09:30,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:30,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 18:09:30,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-12 18:09:30,155 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:09:30,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 1 [2022-07-12 18:09:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:30,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:30,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048039603] [2022-07-12 18:09:30,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048039603] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:30,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:30,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-12 18:09:30,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803721579] [2022-07-12 18:09:30,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:30,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:09:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:09:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2022-07-12 18:09:30,282 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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) [2022-07-12 18:09:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:31,789 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2022-07-12 18:09:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 18:09:31,789 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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 38 [2022-07-12 18:09:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:31,790 INFO L225 Difference]: With dead ends: 301 [2022-07-12 18:09:31,790 INFO L226 Difference]: Without dead ends: 301 [2022-07-12 18:09:31,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=995, Unknown=3, NotChecked=204, Total=1406 [2022-07-12 18:09:31,791 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 403 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:31,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1301 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 857 Invalid, 0 Unknown, 523 Unchecked, 0.9s Time] [2022-07-12 18:09:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-12 18:09:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 182. [2022-07-12 18:09:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 181 states have internal predecessors, (196), 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) [2022-07-12 18:09:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2022-07-12 18:09:31,794 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 38 [2022-07-12 18:09:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:31,794 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2022-07-12 18:09:31,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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) [2022-07-12 18:09:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2022-07-12 18:09:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:09:31,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:31,795 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:31,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:32,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:32,002 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:32,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322345, now seen corresponding path program 1 times [2022-07-12 18:09:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:32,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092434512] [2022-07-12 18:09:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:32,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:32,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:32,005 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:32,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 18:09:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:32,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:09:32,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:32,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:32,139 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 18:09:32,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-07-12 18:09:32,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:09:32,250 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:32,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-12 18:09:32,275 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:32,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-07-12 18:09:32,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-12 18:09:32,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 20 [2022-07-12 18:09:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:32,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:32,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 18:09:32,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (_ bv1 1) (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 18:09:32,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 18:09:32,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:32,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-07-12 18:09:32,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:32,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 43 [2022-07-12 18:09:32,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-07-12 18:09:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:36,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:36,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092434512] [2022-07-12 18:09:36,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092434512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:36,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:36,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-12 18:09:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010604467] [2022-07-12 18:09:36,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:36,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 18:09:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:36,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 18:09:36,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=242, Unknown=5, NotChecked=102, Total=420 [2022-07-12 18:09:36,832 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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) [2022-07-12 18:09:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:37,270 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-07-12 18:09:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:09:37,271 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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 40 [2022-07-12 18:09:37,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:37,272 INFO L225 Difference]: With dead ends: 218 [2022-07-12 18:09:37,272 INFO L226 Difference]: Without dead ends: 218 [2022-07-12 18:09:37,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=106, Invalid=321, Unknown=5, NotChecked=120, Total=552 [2022-07-12 18:09:37,272 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 232 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:37,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 686 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 887 Unchecked, 0.3s Time] [2022-07-12 18:09:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-12 18:09:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2022-07-12 18:09:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 201 states have internal predecessors, (226), 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) [2022-07-12 18:09:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2022-07-12 18:09:37,276 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 40 [2022-07-12 18:09:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:37,276 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2022-07-12 18:09:37,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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) [2022-07-12 18:09:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2022-07-12 18:09:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:09:37,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:37,277 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:37,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-12 18:09:37,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:37,484 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322346, now seen corresponding path program 1 times [2022-07-12 18:09:37,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:37,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964585111] [2022-07-12 18:09:37,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:37,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:37,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:37,486 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:37,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 18:09:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:37,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 18:09:37,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:37,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:37,626 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:37,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:09:37,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-12 18:09:37,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:09:37,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:37,745 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:37,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-12 18:09:37,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:09:37,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-12 18:09:37,786 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:37,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 37 [2022-07-12 18:09:37,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:09:37,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-07-12 18:09:37,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:09:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:37,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:38,207 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 18:09:38,239 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 18:09:38,256 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-12 18:09:38,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:38,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2022-07-12 18:09:38,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:38,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-07-12 18:09:38,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:38,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 55 [2022-07-12 18:09:38,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:38,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 81 [2022-07-12 18:09:38,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 [2022-07-12 18:09:38,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 58 [2022-07-12 18:09:39,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:39,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 28 [2022-07-12 18:09:39,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:39,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 39 [2022-07-12 18:09:39,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2022-07-12 18:09:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:42,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:42,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964585111] [2022-07-12 18:09:42,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964585111] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:42,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:42,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-12 18:09:42,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035363099] [2022-07-12 18:09:42,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:42,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 18:09:42,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:42,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 18:09:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-12 18:09:42,581 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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) [2022-07-12 18:09:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:43,906 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2022-07-12 18:09:43,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:09:43,907 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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 40 [2022-07-12 18:09:43,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:43,908 INFO L225 Difference]: With dead ends: 217 [2022-07-12 18:09:43,908 INFO L226 Difference]: Without dead ends: 217 [2022-07-12 18:09:43,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=164, Invalid=495, Unknown=3, NotChecked=150, Total=812 [2022-07-12 18:09:43,909 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 389 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 649 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:43,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 509 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 458 Invalid, 0 Unknown, 649 Unchecked, 0.8s Time] [2022-07-12 18:09:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-12 18:09:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2022-07-12 18:09:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 201 states have internal predecessors, (225), 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) [2022-07-12 18:09:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2022-07-12 18:09:43,919 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 40 [2022-07-12 18:09:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:43,919 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2022-07-12 18:09:43,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 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) [2022-07-12 18:09:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2022-07-12 18:09:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:09:43,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:43,920 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:43,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:44,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:44,120 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -466746806, now seen corresponding path program 1 times [2022-07-12 18:09:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:44,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779920341] [2022-07-12 18:09:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:44,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:44,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:44,122 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:44,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 18:09:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:44,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:09:44,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:44,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 17 [2022-07-12 18:09:44,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 13 [2022-07-12 18:09:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:09:44,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:09:44,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:44,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779920341] [2022-07-12 18:09:44,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779920341] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:44,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:44,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-12 18:09:44,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832821972] [2022-07-12 18:09:44,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:44,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:09:44,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:44,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:09:44,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:09:44,345 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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) [2022-07-12 18:09:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:44,508 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2022-07-12 18:09:44,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:09:44,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 41 [2022-07-12 18:09:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:44,510 INFO L225 Difference]: With dead ends: 229 [2022-07-12 18:09:44,510 INFO L226 Difference]: Without dead ends: 229 [2022-07-12 18:09:44,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:09:44,510 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 181 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:44,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 334 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:09:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-12 18:09:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2022-07-12 18:09:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 191 states have (on average 1.324607329842932) internal successors, (253), 222 states have internal predecessors, (253), 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) [2022-07-12 18:09:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-07-12 18:09:44,513 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 41 [2022-07-12 18:09:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:44,513 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-07-12 18:09:44,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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) [2022-07-12 18:09:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-07-12 18:09:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:09:44,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:44,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:44,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:44,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:44,724 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:44,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1696634608, now seen corresponding path program 1 times [2022-07-12 18:09:44,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:44,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165892979] [2022-07-12 18:09:44,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:44,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:44,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:44,726 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:44,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 18:09:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:44,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:09:44,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 18:09:44,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:44,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:44,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165892979] [2022-07-12 18:09:44,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165892979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:44,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:44,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:09:44,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759840282] [2022-07-12 18:09:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:44,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:09:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:44,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:09:44,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:44,834 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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) [2022-07-12 18:09:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:44,856 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2022-07-12 18:09:44,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:09:44,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 41 [2022-07-12 18:09:44,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:44,857 INFO L225 Difference]: With dead ends: 283 [2022-07-12 18:09:44,857 INFO L226 Difference]: Without dead ends: 283 [2022-07-12 18:09:44,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:09:44,858 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:44,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 270 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-12 18:09:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2022-07-12 18:09:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.3014354066985645) internal successors, (272), 240 states have internal predecessors, (272), 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) [2022-07-12 18:09:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2022-07-12 18:09:44,861 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 41 [2022-07-12 18:09:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:44,861 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2022-07-12 18:09:44,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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) [2022-07-12 18:09:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2022-07-12 18:09:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:09:44,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:44,861 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:44,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:45,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:45,062 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:45,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1584201975, now seen corresponding path program 1 times [2022-07-12 18:09:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:45,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404079543] [2022-07-12 18:09:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:45,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:45,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:45,064 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:45,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 18:09:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:45,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:09:45,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:45,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:45,196 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:45,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:09:45,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:09:45,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:45,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2022-07-12 18:09:45,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-12 18:09:45,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-12 18:09:45,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-12 18:09:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:45,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:45,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-12 18:09:45,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-12 18:09:45,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-12 18:09:45,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:45,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 18:09:45,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:45,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 18:09:45,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-12 18:09:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:45,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:45,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404079543] [2022-07-12 18:09:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404079543] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:45,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-12 18:09:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554158683] [2022-07-12 18:09:45,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:45,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 18:09:45,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:45,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 18:09:45,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=130, Unknown=3, NotChecked=72, Total=240 [2022-07-12 18:09:45,491 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 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) [2022-07-12 18:09:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:46,285 INFO L93 Difference]: Finished difference Result 258 states and 284 transitions. [2022-07-12 18:09:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:09:46,285 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 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) Word has length 42 [2022-07-12 18:09:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:46,286 INFO L225 Difference]: With dead ends: 258 [2022-07-12 18:09:46,286 INFO L226 Difference]: Without dead ends: 258 [2022-07-12 18:09:46,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=493, Unknown=3, NotChecked=150, Total=812 [2022-07-12 18:09:46,287 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 168 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 451 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:46,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 899 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 547 Invalid, 0 Unknown, 451 Unchecked, 0.5s Time] [2022-07-12 18:09:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-12 18:09:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2022-07-12 18:09:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 242 states have internal predecessors, (274), 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) [2022-07-12 18:09:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 274 transitions. [2022-07-12 18:09:46,302 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 274 transitions. Word has length 42 [2022-07-12 18:09:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:46,303 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 274 transitions. [2022-07-12 18:09:46,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 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) [2022-07-12 18:09:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2022-07-12 18:09:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:09:46,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:46,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:46,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-12 18:09:46,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:46,511 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1471647316, now seen corresponding path program 1 times [2022-07-12 18:09:46,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:46,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057151455] [2022-07-12 18:09:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:46,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:46,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:46,513 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:46,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 18:09:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:46,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:09:46,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:46,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:46,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:46,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057151455] [2022-07-12 18:09:46,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057151455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:46,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:46,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:09:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907782778] [2022-07-12 18:09:46,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:46,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:09:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:09:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:09:46,665 INFO L87 Difference]: Start difference. First operand 243 states and 274 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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) [2022-07-12 18:09:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:46,703 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2022-07-12 18:09:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:09:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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 42 [2022-07-12 18:09:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:46,704 INFO L225 Difference]: With dead ends: 256 [2022-07-12 18:09:46,705 INFO L226 Difference]: Without dead ends: 256 [2022-07-12 18:09:46,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:09:46,705 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 46 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:46,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 357 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:09:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-12 18:09:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 237. [2022-07-12 18:09:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 205 states have (on average 1.273170731707317) internal successors, (261), 236 states have internal predecessors, (261), 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) [2022-07-12 18:09:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 261 transitions. [2022-07-12 18:09:46,715 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 261 transitions. Word has length 42 [2022-07-12 18:09:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:46,715 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 261 transitions. [2022-07-12 18:09:46,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 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) [2022-07-12 18:09:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 261 transitions. [2022-07-12 18:09:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:09:46,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:46,716 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:46,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-12 18:09:46,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:46,924 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:46,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1095816814, now seen corresponding path program 1 times [2022-07-12 18:09:46,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:46,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586235062] [2022-07-12 18:09:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:46,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:46,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:46,926 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:46,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 18:09:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:47,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:09:47,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:47,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:47,090 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:47,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-12 18:09:47,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:09:47,190 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:47,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 28 [2022-07-12 18:09:47,213 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:47,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 28 [2022-07-12 18:09:47,270 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:47,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:09:47,300 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:09:47,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-12 18:09:47,416 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 18:09:47,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2022-07-12 18:09:47,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-12 18:09:47,500 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 18:09:47,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2022-07-12 18:09:47,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-07-12 18:09:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:47,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:47,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 18:09:47,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 18:09:47,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 18:09:47,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-12 18:09:47,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:47,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 21 [2022-07-12 18:09:47,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2022-07-12 18:09:47,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse0)))))) is different from false [2022-07-12 18:09:47,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~item~0#1.offset_75| (_ BitVec 32)) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_13 |v_ULTIMATE.start_main_~item~0#1.offset_75|))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_13) .cse0 v_ArrVal_765) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) is different from false [2022-07-12 18:09:47,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:47,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 25 [2022-07-12 18:09:47,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:47,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 76 [2022-07-12 18:09:47,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:47,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 65 [2022-07-12 18:09:47,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-07-12 18:09:47,815 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:09:47,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 [2022-07-12 18:09:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 18:09:47,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:47,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586235062] [2022-07-12 18:09:47,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586235062] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:47,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:47,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-07-12 18:09:47,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868607275] [2022-07-12 18:09:47,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:47,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 18:09:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 18:09:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=276, Unknown=8, NotChecked=280, Total=650 [2022-07-12 18:09:47,947 INFO L87 Difference]: Start difference. First operand 237 states and 261 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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) [2022-07-12 18:09:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:48,808 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2022-07-12 18:09:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:09:48,809 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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 42 [2022-07-12 18:09:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:48,810 INFO L225 Difference]: With dead ends: 294 [2022-07-12 18:09:48,810 INFO L226 Difference]: Without dead ends: 294 [2022-07-12 18:09:48,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=650, Unknown=9, NotChecked=420, Total=1260 [2022-07-12 18:09:48,810 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 253 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1334 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:48,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 955 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 441 Invalid, 0 Unknown, 1334 Unchecked, 0.5s Time] [2022-07-12 18:09:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-12 18:09:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 259. [2022-07-12 18:09:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 227 states have (on average 1.251101321585903) internal successors, (284), 258 states have internal predecessors, (284), 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) [2022-07-12 18:09:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 284 transitions. [2022-07-12 18:09:48,813 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 284 transitions. Word has length 42 [2022-07-12 18:09:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:48,814 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 284 transitions. [2022-07-12 18:09:48,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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) [2022-07-12 18:09:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 284 transitions. [2022-07-12 18:09:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 18:09:48,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:48,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:48,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:49,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:49,015 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:49,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1865620530, now seen corresponding path program 1 times [2022-07-12 18:09:49,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:49,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556120241] [2022-07-12 18:09:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:49,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:49,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:49,017 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:49,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 18:09:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:49,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:09:49,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:49,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:49,168 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:49,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:09:49,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:09:49,269 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:49,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 27 [2022-07-12 18:09:49,290 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:09:49,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2022-07-12 18:09:49,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 11 [2022-07-12 18:09:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:49,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:09:49,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:49,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-07-12 18:09:49,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:09:49,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 18:09:49,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-07-12 18:09:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:51,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:51,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556120241] [2022-07-12 18:09:51,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556120241] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:09:51,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:09:51,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-12 18:09:51,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618585909] [2022-07-12 18:09:51,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:09:51,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:09:51,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:51,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:09:51,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=233, Unknown=24, NotChecked=0, Total=306 [2022-07-12 18:09:51,756 INFO L87 Difference]: Start difference. First operand 259 states and 284 transitions. Second operand has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 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) [2022-07-12 18:09:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:52,783 INFO L93 Difference]: Finished difference Result 265 states and 286 transitions. [2022-07-12 18:09:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:09:52,784 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 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 43 [2022-07-12 18:09:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:52,785 INFO L225 Difference]: With dead ends: 265 [2022-07-12 18:09:52,785 INFO L226 Difference]: Without dead ends: 265 [2022-07-12 18:09:52,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=222, Invalid=672, Unknown=36, NotChecked=0, Total=930 [2022-07-12 18:09:52,786 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 545 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:52,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 751 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 428 Invalid, 0 Unknown, 257 Unchecked, 0.5s Time] [2022-07-12 18:09:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-12 18:09:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 260. [2022-07-12 18:09:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 228 states have (on average 1.25) internal successors, (285), 259 states have internal predecessors, (285), 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) [2022-07-12 18:09:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2022-07-12 18:09:52,789 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 43 [2022-07-12 18:09:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:52,789 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2022-07-12 18:09:52,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.470588235294118) internal successors, (76), 18 states have internal predecessors, (76), 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) [2022-07-12 18:09:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2022-07-12 18:09:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:09:52,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:52,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:52,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:52,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:52,995 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1999661141, now seen corresponding path program 1 times [2022-07-12 18:09:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:52,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9250739] [2022-07-12 18:09:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:52,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:52,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:52,997 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:52,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 18:09:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:53,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:09:53,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:09:53,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:09:53,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:09:53,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9250739] [2022-07-12 18:09:53,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9250739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:09:53,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:09:53,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:09:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954604170] [2022-07-12 18:09:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:09:53,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:09:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:09:53,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:09:53,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:09:53,104 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:09:53,277 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2022-07-12 18:09:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:09:53,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-12 18:09:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:09:53,278 INFO L225 Difference]: With dead ends: 260 [2022-07-12 18:09:53,278 INFO L226 Difference]: Without dead ends: 260 [2022-07-12 18:09:53,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:09:53,279 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 109 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:09:53,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 172 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:09:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-12 18:09:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2022-07-12 18:09:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 252 states have internal predecessors, (278), 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) [2022-07-12 18:09:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 278 transitions. [2022-07-12 18:09:53,282 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 278 transitions. Word has length 44 [2022-07-12 18:09:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:09:53,283 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 278 transitions. [2022-07-12 18:09:53,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:09:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 278 transitions. [2022-07-12 18:09:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:09:53,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:09:53,283 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:09:53,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 18:09:53,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:09:53,491 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:09:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:09:53,491 INFO L85 PathProgramCache]: Analyzing trace with hash -433899271, now seen corresponding path program 1 times [2022-07-12 18:09:53,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:09:53,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345989226] [2022-07-12 18:09:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:09:53,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:09:53,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:09:53,509 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:09:53,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 18:09:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:09:53,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:09:53,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:09:53,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:09:53,697 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:09:53,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:09:53,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:09:53,790 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:09:53,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-07-12 18:09:53,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-12 18:09:53,863 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-12 18:09:53,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2022-07-12 18:09:53,877 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-12 18:09:53,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-12 18:09:54,152 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 18:09:54,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 36 [2022-07-12 18:09:54,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-12 18:09:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:09:54,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:10:07,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:10:07,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2809 treesize of output 1959 [2022-07-12 18:10:48,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:48,799 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:10:48,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 57 [2022-07-12 18:10:50,888 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (let ((.cse0 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse203 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse203 (store (store (select |c_#memory_$Pointer$.base| .cse203) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse1 (not .cse8)) (.cse21 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse202 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse202 (select (select (store |c_#memory_$Pointer$.base| .cse202 (store (store (select |c_#memory_$Pointer$.base| .cse202) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse201 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse201 (store (store (select |c_#memory_$Pointer$.base| .cse201) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse2 (= (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (.cse3 (and .cse21 .cse11)) (.cse9 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse199 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse200 (select (select (store |c_#memory_$Pointer$.base| .cse199 (store (store (select |c_#memory_$Pointer$.base| .cse199) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (= .cse199 .cse200) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse200)))))) (.cse15 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse198 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse198 (store (store (select |c_#memory_$Pointer$.base| .cse198) |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse198)))) (.cse23 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse197 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse197 (select (select (store |c_#memory_$Pointer$.base| .cse197 (store (store (select |c_#memory_$Pointer$.base| .cse197) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16)))) (.cse24 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse196 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse196 (select (select (store |c_#memory_$Pointer$.base| .cse196 (store (store (select |c_#memory_$Pointer$.base| .cse196) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse4 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse10 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse194 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse195 (select (select (store |c_#memory_$Pointer$.base| .cse194 (store (store (select |c_#memory_$Pointer$.base| .cse194) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse194 .cse195) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse195)))))))) (.cse20 (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32))) (.cse19 (or .cse0 .cse1)) (.cse27 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse193 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse193 (select (select (store |c_#memory_$Pointer$.base| .cse193 (store (store (select |c_#memory_$Pointer$.base| .cse193) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32))))) (.cse28 (or (and .cse0 .cse21) .cse1)) (.cse7 (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse12 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse1 .cse2) (or .cse4 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse5 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse6 (store (store (select |c_#memory_$Pointer$.base| .cse6) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) .cse7 (or .cse8 .cse9) .cse10 (or .cse11 .cse1 .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse14 .cse13))))))) (or (and (or .cse3 .cse1) (or .cse1 (and .cse15 (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse17 (store (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 .cse18) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse18))))))) .cse19 .cse1 (or .cse1 (and .cse0 .cse11)) .cse9 (or .cse20 (and (or .cse1 .cse15) (or .cse21 .cse1) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse22 (select (select (store |c_#memory_$Pointer$.base| .cse22 (store (store (select |c_#memory_$Pointer$.base| .cse22) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse23 .cse24)) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| .cse25 (store (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse25 .cse26) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse26))))))) .cse23 .cse27 (or .cse20 .cse1) .cse28 .cse24 (or .cse4 (let ((.cse80 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse190 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse190 (store (store (select |c_#memory_$Pointer$.base| .cse190) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse52 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse189 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse189 (store (store (select |c_#memory_$Pointer$.base| .cse189) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse43 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (let ((.cse188 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse188 (select (select (store |c_#memory_$Pointer$.base| .cse188 (store (store (select |c_#memory_$Pointer$.base| .cse188) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse38 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse187 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse187 (store (store (select |c_#memory_$Pointer$.base| .cse187) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse74 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse186 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse186 (store (store (select |c_#memory_$Pointer$.base| .cse186) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse185 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse184 (select (select (store |c_#memory_$Pointer$.base| .cse185 (store (store (select |c_#memory_$Pointer$.base| .cse185) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse184) (= .cse185 .cse184)))))) (.cse76 (or .cse52 .cse12)) (.cse111 (or .cse80 .cse12)) (.cse46 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse183 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse182 (select (select (store |c_#memory_$Pointer$.base| .cse183 (store (store (select |c_#memory_$Pointer$.base| .cse183) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse182) (= .cse183 .cse182))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse100 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse180 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse180 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse181 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse181 (store (store (select |c_#memory_$Pointer$.base| .cse181) v_arrayElimCell_136 (_ bv0 32)) .cse180 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse58 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse179 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse179 (store (store (select |c_#memory_$Pointer$.base| .cse179) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse99 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse178 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse177 (select (select (store |c_#memory_$Pointer$.base| .cse178 (store (store (select |c_#memory_$Pointer$.base| .cse178) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse177) (= .cse178 .cse177)))))))) (.cse112 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse175 (select (select (let ((.cse176 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse176 (store (store (select |c_#memory_$Pointer$.base| .cse176) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse175) (= .cse175 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (.cse68 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse173 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse172 (select (select (let ((.cse174 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse174 (store (store (select |c_#memory_$Pointer$.base| .cse174) v_arrayElimCell_136 (_ bv0 32)) .cse173 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse172) (= .cse173 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse172 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse81 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse171 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse170 (select (select (store |c_#memory_$Pointer$.base| .cse171 (store (store (select |c_#memory_$Pointer$.base| .cse171) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse170 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse171 .cse170))))))) (.cse118 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse169 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse169 (store (store (select |c_#memory_$Pointer$.base| .cse169) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse75 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse166 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse168 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse167 (select (select (store |c_#memory_$Pointer$.base| .cse166 (store (store (select |c_#memory_$Pointer$.base| .cse166) v_arrayElimCell_136 (_ bv0 32)) .cse168 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse166 .cse167) (= .cse168 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse167 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse82 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse164 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse164 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse165 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse165 (store (store (select |c_#memory_$Pointer$.base| .cse165) v_arrayElimCell_136 (_ bv0 32)) .cse164 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse53 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse162 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse163 (select (select (store |c_#memory_$Pointer$.base| .cse162 (store (store (select |c_#memory_$Pointer$.base| .cse162) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse162 .cse163) (= .cse163 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse44 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse160 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse161 (select (select (store |c_#memory_$Pointer$.base| .cse160 (store (store (select |c_#memory_$Pointer$.base| .cse160) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse160 .cse161) (= .cse161 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse113 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse159 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse159 (store (store (select |c_#memory_$Pointer$.base| .cse159) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse117 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse156 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse158 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse157 (select (select (store |c_#memory_$Pointer$.base| .cse156 (store (store (select |c_#memory_$Pointer$.base| .cse156) v_arrayElimCell_136 (_ bv0 32)) .cse158 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse156 .cse157) (= .cse158 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse157 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse29 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse155 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse155 (select (select (store |c_#memory_$Pointer$.base| .cse155 (store (store (select |c_#memory_$Pointer$.base| .cse155) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse115 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse154 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse154 (select (select (store |c_#memory_$Pointer$.base| .cse154 (store (store (select |c_#memory_$Pointer$.base| .cse154) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16)))) (.cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse152 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$.base| .cse152 (store (store (select |c_#memory_$Pointer$.base| .cse152) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse152 .cse153) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse153 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse107 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse151 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse150 (select (select (store |c_#memory_$Pointer$.base| .cse151 (store (store (select |c_#memory_$Pointer$.base| .cse151) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse150) (= .cse151 .cse150) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse148 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse149 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse149 (select (select (store |c_#memory_$Pointer$.base| .cse149 (store (store (select |c_#memory_$Pointer$.base| .cse149) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (and (or .cse29 .cse8) .cse30 .cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse34 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| .cse32 (store (store (select |c_#memory_$Pointer$.base| .cse32) v_arrayElimCell_136 (_ bv0 32)) .cse34 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse32 .cse33)) (= .cse34 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse33 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse37 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) .cse37 (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse35 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse36 .cse35)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse37))))) .cse20 .cse38 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse39 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse39 (select (select (store |c_#memory_$Pointer$.base| .cse39 (store (store (select |c_#memory_$Pointer$.base| .cse39) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse41 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse40 (select (select (let ((.cse42 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse42 (store (store (select |c_#memory_$Pointer$.base| .cse42) v_arrayElimCell_136 (_ bv0 32)) .cse41 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse40) (= .cse41 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse40 |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse12 .cse43) (or (and .cse11 .cse44) .cse1) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (store (select |c_#memory_$Pointer$.base| .cse45) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse46 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse47 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse49 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse48 (select (select (store |c_#memory_$Pointer$.base| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) v_arrayElimCell_136 (_ bv0 32)) .cse49 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse47 .cse48) (= .cse49 (_ bv0 32)) (= .cse48 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse50 (select (select (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse50) (= .cse50 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (or .cse8 (and .cse52 .cse53)) .cse10 (or .cse20 (let ((.cse54 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse57 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse57 (select (select (store |c_#memory_$Pointer$.base| .cse57 (store (store (select |c_#memory_$Pointer$.base| .cse57) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and .cse54 (or .cse54 .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_$Pointer$.base| .cse56 (store (store (select |c_#memory_$Pointer$.base| .cse56) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse55) (= .cse56 .cse55))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) .cse43))) .cse58 (or .cse53 .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse59 (select (select (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse59) (= .cse60 .cse59))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse62 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse61 (store (store (select |c_#memory_$Pointer$.base| .cse61) v_arrayElimCell_136 (_ bv0 32)) .cse62 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse62 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse64 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (store (select |c_#memory_$Pointer$.base| .cse63) v_arrayElimCell_136 (_ bv0 32)) .cse64 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse64) (= .cse64 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse65 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse65 (store (store (select |c_#memory_$Pointer$.base| .cse65) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse67 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse66 (select (select (store |c_#memory_$Pointer$.base| .cse67 (store (store (select |c_#memory_$Pointer$.base| .cse67) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse66) (not (= .cse67 .cse66)))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or .cse8 .cse68) .cse19 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse70 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse71 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse69 (select (select (store |c_#memory_$Pointer$.base| .cse70 (store (store (select |c_#memory_$Pointer$.base| .cse70) v_arrayElimCell_136 (_ bv0 32)) .cse71 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse69) (= .cse70 .cse69) (= .cse71 (_ bv0 32)))))) .cse1 (or .cse8 (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse72 (select (select (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse72) (= .cse72 |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse74)) (or .cse75 .cse8) .cse76 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse78 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse77 (select (select (store |c_#memory_$Pointer$.base| .cse78 (store (store (select |c_#memory_$Pointer$.base| .cse78) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse77) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (= .cse78 .cse77)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse79 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse79 (store (store (select |c_#memory_$Pointer$.base| .cse79) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse80 (or .cse8 .cse53) (or .cse12 (and .cse29 .cse1 .cse81)) (or .cse8 .cse82) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse84 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.base| .cse84 (store (store (select |c_#memory_$Pointer$.base| .cse84) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse83) (= .cse84 .cse83))))) (or .cse8 (and .cse38 .cse29)) .cse52 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse85 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse85) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (= .cse86 .cse85)) (= (_ bv4 32) v_arrayElimIndex_16))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse87 (select (select (store |c_#memory_$Pointer$.base| .cse88 (store (store (select |c_#memory_$Pointer$.base| .cse88) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse87) (not (= .cse88 .cse87)))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or .cse8 (and .cse75 .cse82)) (or .cse8 .cse52) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse90 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse91 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| .cse90 (store (store (select |c_#memory_$Pointer$.base| .cse90) v_arrayElimCell_136 (_ bv0 32)) .cse91 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse89) (= .cse90 .cse89) (= .cse91 |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse74 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse92 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse92 (store (store (select |c_#memory_$Pointer$.base| .cse92) (_ bv4294967292 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse94 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse95 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse93 (select (select (store |c_#memory_$Pointer$.base| .cse94 (store (store (select |c_#memory_$Pointer$.base| .cse94) v_arrayElimCell_136 (_ bv0 32)) .cse95 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse93) (= .cse94 .cse93) (= .cse95 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse96 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse96 (select (select (store |c_#memory_$Pointer$.base| .cse96 (store (store (select |c_#memory_$Pointer$.base| .cse96) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse82 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse98 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse97 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse97 (select (select (store |c_#memory_$Pointer$.base| .cse97 (store (store (select |c_#memory_$Pointer$.base| .cse97) v_arrayElimCell_136 (_ bv0 32)) .cse98 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse98 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse99 .cse100 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse102 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse103 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse101 (select (select (store |c_#memory_$Pointer$.base| .cse102 (store (store (select |c_#memory_$Pointer$.base| .cse102) v_arrayElimCell_136 (_ bv0 32)) .cse103 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse101) (= .cse102 .cse101) (= .cse103 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (let ((.cse104 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse104 (select (select (store |c_#memory_$Pointer$.base| .cse104 (store (store (select |c_#memory_$Pointer$.base| .cse104) v_arrayElimCell_136 (_ bv0 32)) .cse105 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= .cse105 (_ bv0 32))))) .cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse106 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse106 (select (select (store |c_#memory_$Pointer$.base| .cse106 (store (store (select |c_#memory_$Pointer$.base| .cse106) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse107) .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse109 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse108 (select (select (store |c_#memory_$Pointer$.base| .cse109 (store (store (select |c_#memory_$Pointer$.base| .cse109) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse108) (= .cse109 .cse108) (= .cse108 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse110 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse110 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (or .cse8 (and .cse76 .cse52 .cse111 .cse112 .cse68 .cse113)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse114 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse114 (store (store (select |c_#memory_$Pointer$.base| .cse114) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse53 .cse111 (or .cse8 .cse115) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse116 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse116 (store (store (select |c_#memory_$Pointer$.base| .cse116) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (or (and .cse31 .cse75 .cse80 .cse52 .cse82 .cse100 .cse53 .cse117) .cse8) (or .cse8 (and .cse46 .cse118)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse119 (select (select (let ((.cse120 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse120 (store (store (select |c_#memory_$Pointer$.base| .cse120) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse119) (= .cse119 |c_ULTIMATE.start_main_~item~0#1.base|)))) (or .cse8 (and .cse100 .cse117)) (or .cse8 (and .cse58 .cse99)) .cse27 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse122 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse123 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse121 (select (select (store |c_#memory_$Pointer$.base| .cse122 (store (store (select |c_#memory_$Pointer$.base| .cse122) v_arrayElimCell_136 (_ bv0 32)) .cse123 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse121) (= .cse122 .cse121) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse123 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse124 (select (select (let ((.cse125 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse125 (store (store (select |c_#memory_$Pointer$.base| .cse125) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse124) (= .cse124 |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse112 .cse68 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse126 (store (store (select |c_#memory_$Pointer$.base| .cse126) v_arrayElimCell_136 (_ bv0 32)) .cse127 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse127 (_ bv0 32))))) .cse28 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse128 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse128 (store (store (select |c_#memory_$Pointer$.base| .cse128) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse81 .cse12 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse130 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse129 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse129 (store (store (select |c_#memory_$Pointer$.base| .cse129) v_arrayElimCell_136 (_ bv0 32)) .cse130 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse130 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse118 (or .cse8 (and .cse75 .cse52 .cse82 .cse53)) (or (and (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse131 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse131 (select (select (store |c_#memory_$Pointer$.base| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse7 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse132 (select (select (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse132 |c_ULTIMATE.start_main_~item~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132)))) .cse11 .cse44 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) .cse1 .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse134 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse135 (select (select (store |c_#memory_$Pointer$.base| .cse134 (store (store (select |c_#memory_$Pointer$.base| .cse134) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse134 .cse135)) (= .cse135 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse137 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse138 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse136 (select (select (store |c_#memory_$Pointer$.base| .cse137 (store (store (select |c_#memory_$Pointer$.base| .cse137) v_arrayElimCell_136 (_ bv0 32)) .cse138 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse136) (= .cse137 .cse136) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse138) (= .cse138 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse139 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse139 (_ bv0 32)) (= (select (select (let ((.cse140 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse140 (store (store (select |c_#memory_$Pointer$.base| .cse140) v_arrayElimCell_136 (_ bv0 32)) .cse139 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (or .cse12 (and .cse80 .cse52)) .cse113 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse142 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse143 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse141 (select (select (store |c_#memory_$Pointer$.base| .cse142 (store (store (select |c_#memory_$Pointer$.base| .cse142) v_arrayElimCell_136 (_ bv0 32)) .cse143 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse141) (= .cse142 .cse141) (= .cse143 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse141 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse117 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse145 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse144 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse144 (store (store (select |c_#memory_$Pointer$.base| .cse144) v_arrayElimCell_136 (_ bv0 32)) .cse145 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse145 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and .cse29 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse146 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse146 (select (select (store |c_#memory_$Pointer$.base| .cse146 (store (store (select |c_#memory_$Pointer$.base| .cse146) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (let ((.cse147 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse147 (select (select (store |c_#memory_$Pointer$.base| .cse147 (store (store (select |c_#memory_$Pointer$.base| .cse147) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) .cse148 .cse115) .cse12) (or .cse8 (and .cse31 .cse80)) .cse107 (or .cse8 .cse148))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse192 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse191 (select (select (store |c_#memory_$Pointer$.base| .cse192 (store (store (select |c_#memory_$Pointer$.base| .cse192) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse191 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse192 .cse191) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse191))))))))) is different from true [2022-07-12 18:10:57,201 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse93 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse134 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse134 (select (select (store |c_#memory_$Pointer$.base| .cse134 (store (store (select |c_#memory_$Pointer$.base| .cse134) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)))))) (and (or .cse0 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (store (select |c_#memory_$Pointer$.base| .cse2) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| .cse3 (store (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse3 .cse4) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse4))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| .cse6 (store (store (select |c_#memory_$Pointer$.base| .cse6) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse6 .cse5))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| .cse7 (store (store (select |c_#memory_$Pointer$.base| .cse7) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 .cse8) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse8))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| .cse9 (store (store (select |c_#memory_$Pointer$.base| .cse9) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (= .cse9 .cse10) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse10))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.base| .cse11 (store (store (select |c_#memory_$Pointer$.base| .cse11) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 .cse12) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse12))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse13 (select (select (store |c_#memory_$Pointer$.base| .cse13 (store (store (select |c_#memory_$Pointer$.base| .cse13) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse14 (select (select (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse15) (= .cse16 .cse15))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse17 (store (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 .cse18) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse18 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse21 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| .cse19 (store (store (select |c_#memory_$Pointer$.base| .cse19) v_arrayElimCell_136 (_ bv0 32)) .cse21 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse19 .cse20)) (= .cse21 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse20 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse24 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| .cse23 (store (store (select |c_#memory_$Pointer$.base| .cse23) .cse24 (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse23 .cse22)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse24))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse27 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| .cse26 (store (store (select |c_#memory_$Pointer$.base| .cse26) v_arrayElimCell_136 (_ bv0 32)) .cse27 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse25) (= .cse26 .cse25) (= .cse27 (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse28 (store (store (select |c_#memory_$Pointer$.base| .cse28) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse30 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse29 (store (store (select |c_#memory_$Pointer$.base| .cse29) v_arrayElimCell_136 (_ bv0 32)) .cse30 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse30 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse31 (select (select (store |c_#memory_$Pointer$.base| .cse31 (store (store (select |c_#memory_$Pointer$.base| .cse31) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse33 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse32 (select (select (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse34 (store (store (select |c_#memory_$Pointer$.base| .cse34) v_arrayElimCell_136 (_ bv0 32)) .cse33 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse32) (= .cse33 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse32 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse35) (= .cse36 .cse35))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse37 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse39 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse37 (store (store (select |c_#memory_$Pointer$.base| .cse37) v_arrayElimCell_136 (_ bv0 32)) .cse39 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse37 .cse38) (= .cse39 (_ bv0 32)) (= .cse38 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse40 (store (store (select |c_#memory_$Pointer$.base| .cse40) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse41 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse41 (select (select (store |c_#memory_$Pointer$.base| .cse41 (store (store (select |c_#memory_$Pointer$.base| .cse41) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse42 (select (select (store |c_#memory_$Pointer$.base| .cse43 (store (store (select |c_#memory_$Pointer$.base| .cse43) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse42) (= .cse43 .cse42))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse45 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse44 (store (store (select |c_#memory_$Pointer$.base| .cse44) v_arrayElimCell_136 (_ bv0 32)) .cse45 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse45 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse46 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse46 (select (select (store |c_#memory_$Pointer$.base| .cse46 (store (store (select |c_#memory_$Pointer$.base| .cse46) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse47 (select (select (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse48 (store (store (select |c_#memory_$Pointer$.base| .cse48) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse47) (= .cse47 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse49 (store (store (select |c_#memory_$Pointer$.base| .cse49) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse50 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse50 (select (select (store |c_#memory_$Pointer$.base| .cse50 (store (store (select |c_#memory_$Pointer$.base| .cse50) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse53 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse54 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.base| .cse53 (store (store (select |c_#memory_$Pointer$.base| .cse53) v_arrayElimCell_136 (_ bv0 32)) .cse54 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse52) (= .cse53 .cse52) (= .cse54 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse55 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse57 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse56 (select (select (store |c_#memory_$Pointer$.base| .cse55 (store (store (select |c_#memory_$Pointer$.base| .cse55) v_arrayElimCell_136 (_ bv0 32)) .cse57 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse55 .cse56) (= .cse57 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse56 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse58 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse58 (select (select (store |c_#memory_$Pointer$.base| .cse58 (store (store (select |c_#memory_$Pointer$.base| .cse58) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse59 (store (store (select |c_#memory_$Pointer$.base| .cse59) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse62 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse61 (select (select (store |c_#memory_$Pointer$.base| .cse62 (store (store (select |c_#memory_$Pointer$.base| .cse62) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse61) (= .cse62 .cse61))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (store (select |c_#memory_$Pointer$.base| .cse63) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse64 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse64 (store (store (select |c_#memory_$Pointer$.base| .cse64) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse66 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse67 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse65 (select (select (store |c_#memory_$Pointer$.base| .cse66 (store (store (select |c_#memory_$Pointer$.base| .cse66) v_arrayElimCell_136 (_ bv0 32)) .cse67 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse65) (= .cse66 .cse65) (= .cse67 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse68 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse68 (store (store (select |c_#memory_$Pointer$.base| .cse68) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse69 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse69 (store (store (select |c_#memory_$Pointer$.base| .cse69) (_ bv4294967292 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse71 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse72 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse71 (store (store (select |c_#memory_$Pointer$.base| .cse71) v_arrayElimCell_136 (_ bv0 32)) .cse72 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse70) (= .cse71 .cse70) (= .cse72 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse73 (select (select (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse74 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse74 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse75 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse75 (store (store (select |c_#memory_$Pointer$.base| .cse75) v_arrayElimCell_136 (_ bv0 32)) .cse74 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse77 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse76 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse76 (select (select (store |c_#memory_$Pointer$.base| .cse76 (store (store (select |c_#memory_$Pointer$.base| .cse76) v_arrayElimCell_136 (_ bv0 32)) .cse77 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse77 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse79 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse78 (select (select (store |c_#memory_$Pointer$.base| .cse79 (store (store (select |c_#memory_$Pointer$.base| .cse79) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse78) (= .cse79 .cse78))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse80 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse80 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse81 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse81 (store (store (select |c_#memory_$Pointer$.base| .cse81) v_arrayElimCell_136 (_ bv0 32)) .cse80 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse83 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse84 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse82 (select (select (store |c_#memory_$Pointer$.base| .cse83 (store (store (select |c_#memory_$Pointer$.base| .cse83) v_arrayElimCell_136 (_ bv0 32)) .cse84 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse82) (= .cse83 .cse82) (= .cse84 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse85 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse85) (= .cse86 .cse85) (= .cse85 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse87 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse87 (store (store (select |c_#memory_$Pointer$.base| .cse87) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| .cse88 (store (store (select |c_#memory_$Pointer$.base| .cse88) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse88 .cse89) (= .cse89 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse90 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse90 (store (store (select |c_#memory_$Pointer$.base| .cse90) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse91 (select (select (let ((.cse92 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse92 (store (store (select |c_#memory_$Pointer$.base| .cse92) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse91) (= .cse91 |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse93 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse95 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse96 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse94 (select (select (store |c_#memory_$Pointer$.base| .cse95 (store (store (select |c_#memory_$Pointer$.base| .cse95) v_arrayElimCell_136 (_ bv0 32)) .cse96 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse94) (= .cse95 .cse94) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse96 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse97 (select (select (let ((.cse98 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse98 (store (store (select |c_#memory_$Pointer$.base| .cse98) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse97) (= .cse97 |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse99 (select (select (let ((.cse100 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse100 (store (store (select |c_#memory_$Pointer$.base| .cse100) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse99) (= .cse99 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse102 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse101 (select (select (let ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) v_arrayElimCell_136 (_ bv0 32)) .cse102 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse101) (= .cse102 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse101 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse104 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse104 (store (store (select |c_#memory_$Pointer$.base| .cse104) v_arrayElimCell_136 (_ bv0 32)) .cse105 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse105 (_ bv0 32))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse107 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse106 (select (select (store |c_#memory_$Pointer$.base| .cse107 (store (store (select |c_#memory_$Pointer$.base| .cse107) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse106 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse107 .cse106)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse109 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse108 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse108 (store (store (select |c_#memory_$Pointer$.base| .cse108) v_arrayElimCell_136 (_ bv0 32)) .cse109 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse109 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (let ((.cse110 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse110 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse111 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse111 (select (select (store |c_#memory_$Pointer$.base| .cse111 (store (store (select |c_#memory_$Pointer$.base| .cse111) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse112 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse112 (store (store (select |c_#memory_$Pointer$.base| .cse112) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse113 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse114 (select (select (store |c_#memory_$Pointer$.base| .cse113 (store (store (select |c_#memory_$Pointer$.base| .cse113) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse113 .cse114)) (= .cse114 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse115 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse116 (select (select (store |c_#memory_$Pointer$.base| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse115 .cse116) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse116))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse117 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse117 (_ bv0 32)) (= (select (select (let ((.cse118 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse118 (store (store (select |c_#memory_$Pointer$.base| .cse118) v_arrayElimCell_136 (_ bv0 32)) .cse117 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse119 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse119 (store (store (select |c_#memory_$Pointer$.base| .cse119) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse121 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse122 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse120 (select (select (store |c_#memory_$Pointer$.base| .cse121 (store (store (select |c_#memory_$Pointer$.base| .cse121) v_arrayElimCell_136 (_ bv0 32)) .cse122 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse120) (= .cse121 .cse120) (= .cse122 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse120 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse123 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse125 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse124 (select (select (store |c_#memory_$Pointer$.base| .cse123 (store (store (select |c_#memory_$Pointer$.base| .cse123) v_arrayElimCell_136 (_ bv0 32)) .cse125 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse123 .cse124) (= .cse125 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse124 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse126 (store (store (select |c_#memory_$Pointer$.base| .cse126) v_arrayElimCell_136 (_ bv0 32)) .cse127 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse127 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse128 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse128 (select (select (store |c_#memory_$Pointer$.base| .cse128 (store (store (select |c_#memory_$Pointer$.base| .cse128) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse130 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse129 (select (select (store |c_#memory_$Pointer$.base| .cse130 (store (store (select |c_#memory_$Pointer$.base| .cse130) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse129) (= .cse130 .cse129) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) .cse93 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse131 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse131 (select (select (store |c_#memory_$Pointer$.base| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse132 (select (select (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse132 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse133 .cse132) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132))))))) is different from true [2022-07-12 18:10:57,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:57,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:57,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:10:57,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 924 treesize of output 667 [2022-07-12 18:10:59,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:59,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:59,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:59,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:59,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:59,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:59,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:59,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:10:59,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:10:59,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:11:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:11:03,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:11:03,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345989226] [2022-07-12 18:11:03,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345989226] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:11:03,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:11:03,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2022-07-12 18:11:03,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96414361] [2022-07-12 18:11:03,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:11:03,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:11:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:11:03,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:11:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=366, Unknown=4, NotChecked=78, Total=506 [2022-07-12 18:11:03,230 INFO L87 Difference]: Start difference. First operand 253 states and 278 transitions. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:11:06,018 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse93 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse134 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse134 (select (select (store |c_#memory_$Pointer$.base| .cse134 (store (store (select |c_#memory_$Pointer$.base| .cse134) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)))))) (and (= (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) .cse0 (or .cse0 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse2 (store (store (select |c_#memory_$Pointer$.base| .cse2) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| .cse3 (store (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse3 .cse4) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse4))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| .cse6 (store (store (select |c_#memory_$Pointer$.base| .cse6) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse6 .cse5))))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| .cse7 (store (store (select |c_#memory_$Pointer$.base| .cse7) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse7 .cse8) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse8))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| .cse9 (store (store (select |c_#memory_$Pointer$.base| .cse9) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (= .cse9 .cse10) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse10))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$.base| .cse11 (store (store (select |c_#memory_$Pointer$.base| .cse11) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse11 .cse12) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse12))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse13 (select (select (store |c_#memory_$Pointer$.base| .cse13 (store (store (select |c_#memory_$Pointer$.base| .cse13) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse14 (select (select (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse15) (= .cse16 .cse15))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse17 (store (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 .cse18) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse18 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse21 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| .cse19 (store (store (select |c_#memory_$Pointer$.base| .cse19) v_arrayElimCell_136 (_ bv0 32)) .cse21 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse19 .cse20)) (= .cse21 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse20 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse24 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| .cse23 (store (store (select |c_#memory_$Pointer$.base| .cse23) .cse24 (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse23 .cse22)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse24))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse27 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| .cse26 (store (store (select |c_#memory_$Pointer$.base| .cse26) v_arrayElimCell_136 (_ bv0 32)) .cse27 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse25) (= .cse26 .cse25) (= .cse27 (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse28 (store (store (select |c_#memory_$Pointer$.base| .cse28) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse30 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse29 (store (store (select |c_#memory_$Pointer$.base| .cse29) v_arrayElimCell_136 (_ bv0 32)) .cse30 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse30 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse31 (select (select (store |c_#memory_$Pointer$.base| .cse31 (store (store (select |c_#memory_$Pointer$.base| .cse31) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse33 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse32 (select (select (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse34 (store (store (select |c_#memory_$Pointer$.base| .cse34) v_arrayElimCell_136 (_ bv0 32)) .cse33 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse32) (= .cse33 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse32 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse35) (= .cse36 .cse35))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse37 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse39 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse37 (store (store (select |c_#memory_$Pointer$.base| .cse37) v_arrayElimCell_136 (_ bv0 32)) .cse39 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse37 .cse38) (= .cse39 (_ bv0 32)) (= .cse38 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse40 (store (store (select |c_#memory_$Pointer$.base| .cse40) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse41 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse41 (select (select (store |c_#memory_$Pointer$.base| .cse41 (store (store (select |c_#memory_$Pointer$.base| .cse41) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse42 (select (select (store |c_#memory_$Pointer$.base| .cse43 (store (store (select |c_#memory_$Pointer$.base| .cse43) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse42) (= .cse43 .cse42))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse45 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse44 (store (store (select |c_#memory_$Pointer$.base| .cse44) v_arrayElimCell_136 (_ bv0 32)) .cse45 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse45 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse46 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse46 (select (select (store |c_#memory_$Pointer$.base| .cse46 (store (store (select |c_#memory_$Pointer$.base| .cse46) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse47 (select (select (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse48 (store (store (select |c_#memory_$Pointer$.base| .cse48) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse47) (= .cse47 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse49 (store (store (select |c_#memory_$Pointer$.base| .cse49) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse50 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse50 (select (select (store |c_#memory_$Pointer$.base| .cse50 (store (store (select |c_#memory_$Pointer$.base| .cse50) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse53 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse54 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.base| .cse53 (store (store (select |c_#memory_$Pointer$.base| .cse53) v_arrayElimCell_136 (_ bv0 32)) .cse54 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse52) (= .cse53 .cse52) (= .cse54 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse55 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse57 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse56 (select (select (store |c_#memory_$Pointer$.base| .cse55 (store (store (select |c_#memory_$Pointer$.base| .cse55) v_arrayElimCell_136 (_ bv0 32)) .cse57 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse55 .cse56) (= .cse57 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse56 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse58 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse58 (select (select (store |c_#memory_$Pointer$.base| .cse58 (store (store (select |c_#memory_$Pointer$.base| .cse58) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse59 (store (store (select |c_#memory_$Pointer$.base| .cse59) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse62 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse61 (select (select (store |c_#memory_$Pointer$.base| .cse62 (store (store (select |c_#memory_$Pointer$.base| .cse62) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse61) (= .cse62 .cse61))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (store (select |c_#memory_$Pointer$.base| .cse63) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse64 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse64 (store (store (select |c_#memory_$Pointer$.base| .cse64) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse66 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse67 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse65 (select (select (store |c_#memory_$Pointer$.base| .cse66 (store (store (select |c_#memory_$Pointer$.base| .cse66) v_arrayElimCell_136 (_ bv0 32)) .cse67 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse65) (= .cse66 .cse65) (= .cse67 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse68 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse68 (store (store (select |c_#memory_$Pointer$.base| .cse68) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse69 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse69 (store (store (select |c_#memory_$Pointer$.base| .cse69) (_ bv4294967292 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse71 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse72 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse71 (store (store (select |c_#memory_$Pointer$.base| .cse71) v_arrayElimCell_136 (_ bv0 32)) .cse72 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse70) (= .cse71 .cse70) (= .cse72 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse73 (select (select (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse74 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse74 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse75 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse75 (store (store (select |c_#memory_$Pointer$.base| .cse75) v_arrayElimCell_136 (_ bv0 32)) .cse74 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse77 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse76 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse76 (select (select (store |c_#memory_$Pointer$.base| .cse76 (store (store (select |c_#memory_$Pointer$.base| .cse76) v_arrayElimCell_136 (_ bv0 32)) .cse77 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse77 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse79 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse78 (select (select (store |c_#memory_$Pointer$.base| .cse79 (store (store (select |c_#memory_$Pointer$.base| .cse79) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse78) (= .cse79 .cse78))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse80 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse80 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse81 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse81 (store (store (select |c_#memory_$Pointer$.base| .cse81) v_arrayElimCell_136 (_ bv0 32)) .cse80 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse83 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse84 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse82 (select (select (store |c_#memory_$Pointer$.base| .cse83 (store (store (select |c_#memory_$Pointer$.base| .cse83) v_arrayElimCell_136 (_ bv0 32)) .cse84 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse82) (= .cse83 .cse82) (= .cse84 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse85 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse85) (= .cse86 .cse85) (= .cse85 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse87 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse87 (store (store (select |c_#memory_$Pointer$.base| .cse87) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| .cse88 (store (store (select |c_#memory_$Pointer$.base| .cse88) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse88 .cse89) (= .cse89 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse90 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse90 (store (store (select |c_#memory_$Pointer$.base| .cse90) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse91 (select (select (let ((.cse92 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse92 (store (store (select |c_#memory_$Pointer$.base| .cse92) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse91) (= .cse91 |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse93 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse95 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse96 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse94 (select (select (store |c_#memory_$Pointer$.base| .cse95 (store (store (select |c_#memory_$Pointer$.base| .cse95) v_arrayElimCell_136 (_ bv0 32)) .cse96 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse94) (= .cse95 .cse94) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse96 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse97 (select (select (let ((.cse98 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse98 (store (store (select |c_#memory_$Pointer$.base| .cse98) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse97) (= .cse97 |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse99 (select (select (let ((.cse100 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse100 (store (store (select |c_#memory_$Pointer$.base| .cse100) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse99) (= .cse99 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse102 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse101 (select (select (let ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) v_arrayElimCell_136 (_ bv0 32)) .cse102 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse101) (= .cse102 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse101 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse104 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse104 (store (store (select |c_#memory_$Pointer$.base| .cse104) v_arrayElimCell_136 (_ bv0 32)) .cse105 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse105 (_ bv0 32))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse107 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse106 (select (select (store |c_#memory_$Pointer$.base| .cse107 (store (store (select |c_#memory_$Pointer$.base| .cse107) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse106 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse107 .cse106)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse109 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse108 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse108 (store (store (select |c_#memory_$Pointer$.base| .cse108) v_arrayElimCell_136 (_ bv0 32)) .cse109 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse109 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (let ((.cse110 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse110 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse111 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse111 (select (select (store |c_#memory_$Pointer$.base| .cse111 (store (store (select |c_#memory_$Pointer$.base| .cse111) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse112 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse112 (store (store (select |c_#memory_$Pointer$.base| .cse112) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse113 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse114 (select (select (store |c_#memory_$Pointer$.base| .cse113 (store (store (select |c_#memory_$Pointer$.base| .cse113) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse113 .cse114)) (= .cse114 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse115 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse116 (select (select (store |c_#memory_$Pointer$.base| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse115 .cse116) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse116))))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse117 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse117 (_ bv0 32)) (= (select (select (let ((.cse118 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse118 (store (store (select |c_#memory_$Pointer$.base| .cse118) v_arrayElimCell_136 (_ bv0 32)) .cse117 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse119 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse119 (store (store (select |c_#memory_$Pointer$.base| .cse119) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse121 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse122 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse120 (select (select (store |c_#memory_$Pointer$.base| .cse121 (store (store (select |c_#memory_$Pointer$.base| .cse121) v_arrayElimCell_136 (_ bv0 32)) .cse122 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse120) (= .cse121 .cse120) (= .cse122 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse120 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse123 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse125 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse124 (select (select (store |c_#memory_$Pointer$.base| .cse123 (store (store (select |c_#memory_$Pointer$.base| .cse123) v_arrayElimCell_136 (_ bv0 32)) .cse125 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse123 .cse124) (= .cse125 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse124 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse126 (store (store (select |c_#memory_$Pointer$.base| .cse126) v_arrayElimCell_136 (_ bv0 32)) .cse127 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse127 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse128 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse128 (select (select (store |c_#memory_$Pointer$.base| .cse128 (store (store (select |c_#memory_$Pointer$.base| .cse128) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse130 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse129 (select (select (store |c_#memory_$Pointer$.base| .cse130 (store (store (select |c_#memory_$Pointer$.base| .cse130) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse129) (= .cse130 .cse129) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) .cse93 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse131 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse131 (select (select (store |c_#memory_$Pointer$.base| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse132 (select (select (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse132 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse133 .cse132) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132))))))) is different from true [2022-07-12 18:11:08,077 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (let ((.cse1 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse203 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse203 (store (store (select |c_#memory_$Pointer$.base| .cse203) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse2 (not .cse8)) (.cse21 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse202 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse202 (select (select (store |c_#memory_$Pointer$.base| .cse202 (store (store (select |c_#memory_$Pointer$.base| .cse202) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse201 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse201 (store (store (select |c_#memory_$Pointer$.base| .cse201) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse3 (= (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (.cse4 (and .cse21 .cse11)) (.cse9 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse199 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse200 (select (select (store |c_#memory_$Pointer$.base| .cse199 (store (store (select |c_#memory_$Pointer$.base| .cse199) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (= .cse199 .cse200) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse200)))))) (.cse15 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse198 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse198 (store (store (select |c_#memory_$Pointer$.base| .cse198) |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse198)))) (.cse23 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse197 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse197 (select (select (store |c_#memory_$Pointer$.base| .cse197 (store (store (select |c_#memory_$Pointer$.base| .cse197) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16)))) (.cse24 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse196 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse196 (select (select (store |c_#memory_$Pointer$.base| .cse196 (store (store (select |c_#memory_$Pointer$.base| .cse196) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse10 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse194 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse195 (select (select (store |c_#memory_$Pointer$.base| .cse194 (store (store (select |c_#memory_$Pointer$.base| .cse194) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse194 .cse195) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse195)))))))) (.cse20 (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32))) (.cse19 (or .cse1 .cse2)) (.cse27 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse193 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse193 (select (select (store |c_#memory_$Pointer$.base| .cse193 (store (store (select |c_#memory_$Pointer$.base| .cse193) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32))))) (.cse28 (or (and .cse1 .cse21) .cse2)) (.cse7 (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse12 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)))) (and .cse0 (or .cse1 .cse2 .cse3) (or .cse4 .cse2 .cse3) (or .cse0 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse5 (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse6 (store (store (select |c_#memory_$Pointer$.base| .cse6) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) .cse7 (or .cse8 .cse9) .cse10 (or .cse11 .cse2 .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| .cse14 (store (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse14 .cse13))))))) (or (and (or .cse4 .cse2) (or .cse2 (and .cse15 (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse17 (store (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse17 .cse18) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse18))))))) .cse19 .cse2 (or .cse2 (and .cse1 .cse11)) .cse9 (or .cse20 (and (or .cse2 .cse15) (or .cse21 .cse2) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16) (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse22 (select (select (store |c_#memory_$Pointer$.base| .cse22 (store (store (select |c_#memory_$Pointer$.base| .cse22) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse23 .cse24)) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (= (bvadd (_ bv4 32) v_arrayElimIndex_16) (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse26 (select (select (store |c_#memory_$Pointer$.base| .cse25 (store (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse25 .cse26) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse26))))))) .cse23 .cse27 (or .cse20 .cse2) .cse28 .cse24 (or .cse0 (let ((.cse80 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse190 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse190 (store (store (select |c_#memory_$Pointer$.base| .cse190) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse52 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse189 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse189 (store (store (select |c_#memory_$Pointer$.base| .cse189) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse43 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (let ((.cse188 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse188 (select (select (store |c_#memory_$Pointer$.base| .cse188 (store (store (select |c_#memory_$Pointer$.base| .cse188) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse38 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse187 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse187 (store (store (select |c_#memory_$Pointer$.base| .cse187) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse74 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse186 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse186 (store (store (select |c_#memory_$Pointer$.base| .cse186) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse185 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse184 (select (select (store |c_#memory_$Pointer$.base| .cse185 (store (store (select |c_#memory_$Pointer$.base| .cse185) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse184) (= .cse185 .cse184)))))) (.cse76 (or .cse52 .cse12)) (.cse111 (or .cse80 .cse12)) (.cse46 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse183 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse182 (select (select (store |c_#memory_$Pointer$.base| .cse183 (store (store (select |c_#memory_$Pointer$.base| .cse183) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse182) (= .cse183 .cse182))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse100 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse180 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse180 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse181 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse181 (store (store (select |c_#memory_$Pointer$.base| .cse181) v_arrayElimCell_136 (_ bv0 32)) .cse180 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse58 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse179 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse179 (store (store (select |c_#memory_$Pointer$.base| .cse179) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse99 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse178 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse177 (select (select (store |c_#memory_$Pointer$.base| .cse178 (store (store (select |c_#memory_$Pointer$.base| .cse178) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse177) (= .cse178 .cse177)))))))) (.cse112 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse175 (select (select (let ((.cse176 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse176 (store (store (select |c_#memory_$Pointer$.base| .cse176) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse175) (= .cse175 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (.cse68 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse173 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse172 (select (select (let ((.cse174 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse174 (store (store (select |c_#memory_$Pointer$.base| .cse174) v_arrayElimCell_136 (_ bv0 32)) .cse173 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse172) (= .cse173 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse172 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse81 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse171 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse170 (select (select (store |c_#memory_$Pointer$.base| .cse171 (store (store (select |c_#memory_$Pointer$.base| .cse171) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse170 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse171 .cse170))))))) (.cse118 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse169 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse169 (store (store (select |c_#memory_$Pointer$.base| .cse169) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse75 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse166 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse168 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse167 (select (select (store |c_#memory_$Pointer$.base| .cse166 (store (store (select |c_#memory_$Pointer$.base| .cse166) v_arrayElimCell_136 (_ bv0 32)) .cse168 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse166 .cse167) (= .cse168 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse167 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse82 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse164 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse164 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select (let ((.cse165 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse165 (store (store (select |c_#memory_$Pointer$.base| .cse165) v_arrayElimCell_136 (_ bv0 32)) .cse164 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse53 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse162 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse163 (select (select (store |c_#memory_$Pointer$.base| .cse162 (store (store (select |c_#memory_$Pointer$.base| .cse162) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse162 .cse163) (= .cse163 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse44 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse160 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse161 (select (select (store |c_#memory_$Pointer$.base| .cse160 (store (store (select |c_#memory_$Pointer$.base| .cse160) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse160 .cse161) (= .cse161 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse113 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse159 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse159 (store (store (select |c_#memory_$Pointer$.base| .cse159) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse117 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse156 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse158 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse157 (select (select (store |c_#memory_$Pointer$.base| .cse156 (store (store (select |c_#memory_$Pointer$.base| .cse156) v_arrayElimCell_136 (_ bv0 32)) .cse158 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse156 .cse157) (= .cse158 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse157 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse29 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse155 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse155 (select (select (store |c_#memory_$Pointer$.base| .cse155 (store (store (select |c_#memory_$Pointer$.base| .cse155) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse115 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse154 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse154 (select (select (store |c_#memory_$Pointer$.base| .cse154 (store (store (select |c_#memory_$Pointer$.base| .cse154) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16)))) (.cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse152 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$.base| .cse152 (store (store (select |c_#memory_$Pointer$.base| .cse152) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse152 .cse153) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse153 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse107 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse151 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse150 (select (select (store |c_#memory_$Pointer$.base| .cse151 (store (store (select |c_#memory_$Pointer$.base| .cse151) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse150) (= .cse151 .cse150) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse148 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse149 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse149 (select (select (store |c_#memory_$Pointer$.base| .cse149 (store (store (select |c_#memory_$Pointer$.base| .cse149) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (and (or .cse29 .cse8) .cse30 .cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse34 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| .cse32 (store (store (select |c_#memory_$Pointer$.base| .cse32) v_arrayElimCell_136 (_ bv0 32)) .cse34 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse32 .cse33)) (= .cse34 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse33 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse37 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) .cse37 (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse35 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse36 .cse35)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse37))))) .cse20 .cse38 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse39 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse39 (select (select (store |c_#memory_$Pointer$.base| .cse39 (store (store (select |c_#memory_$Pointer$.base| .cse39) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse41 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse40 (select (select (let ((.cse42 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse42 (store (store (select |c_#memory_$Pointer$.base| .cse42) v_arrayElimCell_136 (_ bv0 32)) .cse41 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse40) (= .cse41 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse40 |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse12 .cse43) (or (and .cse11 .cse44) .cse2) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (store (select |c_#memory_$Pointer$.base| .cse45) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse46 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse47 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse49 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse48 (select (select (store |c_#memory_$Pointer$.base| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) v_arrayElimCell_136 (_ bv0 32)) .cse49 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse47 .cse48) (= .cse49 (_ bv0 32)) (= .cse48 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 v_arrayElimIndex_16) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse50 (select (select (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse50) (= .cse50 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (or .cse8 (and .cse52 .cse53)) .cse10 (or .cse20 (let ((.cse54 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse57 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse57 (select (select (store |c_#memory_$Pointer$.base| .cse57 (store (store (select |c_#memory_$Pointer$.base| .cse57) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and .cse54 (or .cse54 .cse12) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_$Pointer$.base| .cse56 (store (store (select |c_#memory_$Pointer$.base| .cse56) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse55) (= .cse56 .cse55))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) .cse43))) .cse58 (or .cse53 .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse59 (select (select (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse59) (= .cse60 .cse59))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse62 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse61 (store (store (select |c_#memory_$Pointer$.base| .cse61) v_arrayElimCell_136 (_ bv0 32)) .cse62 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse62 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse64 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (store (select |c_#memory_$Pointer$.base| .cse63) v_arrayElimCell_136 (_ bv0 32)) .cse64 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse64) (= .cse64 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse65 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse65 (store (store (select |c_#memory_$Pointer$.base| .cse65) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse67 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse66 (select (select (store |c_#memory_$Pointer$.base| .cse67 (store (store (select |c_#memory_$Pointer$.base| .cse67) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse66) (not (= .cse67 .cse66)))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or .cse8 .cse68) .cse19 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse70 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse71 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse69 (select (select (store |c_#memory_$Pointer$.base| .cse70 (store (store (select |c_#memory_$Pointer$.base| .cse70) v_arrayElimCell_136 (_ bv0 32)) .cse71 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse69) (= .cse70 .cse69) (= .cse71 (_ bv0 32)))))) .cse2 (or .cse8 (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse72 (select (select (let ((.cse73 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse73 (store (store (select |c_#memory_$Pointer$.base| .cse73) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse72) (= .cse72 |c_ULTIMATE.start_main_~item~0#1.base|)))))) .cse74)) (or .cse75 .cse8) .cse76 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse78 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse77 (select (select (store |c_#memory_$Pointer$.base| .cse78 (store (store (select |c_#memory_$Pointer$.base| .cse78) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse77) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (= .cse78 .cse77)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse79 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse79 (store (store (select |c_#memory_$Pointer$.base| .cse79) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse80 (or .cse8 .cse53) (or .cse12 (and .cse29 .cse2 .cse81)) (or .cse8 .cse82) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse84 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.base| .cse84 (store (store (select |c_#memory_$Pointer$.base| .cse84) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse83) (= .cse84 .cse83))))) (or .cse8 (and .cse38 .cse29)) .cse52 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse85 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse85) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (= .cse86 .cse85)) (= (_ bv4 32) v_arrayElimIndex_16))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse87 (select (select (store |c_#memory_$Pointer$.base| .cse88 (store (store (select |c_#memory_$Pointer$.base| .cse88) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse87) (not (= .cse88 .cse87)))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) (or .cse8 (and .cse75 .cse82)) (or .cse8 .cse52) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse90 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse91 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse89 (select (select (store |c_#memory_$Pointer$.base| .cse90 (store (store (select |c_#memory_$Pointer$.base| .cse90) v_arrayElimCell_136 (_ bv0 32)) .cse91 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse89) (= .cse90 .cse89) (= .cse91 |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse74 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse92 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse92 (store (store (select |c_#memory_$Pointer$.base| .cse92) (_ bv4294967292 32) (_ bv0 32)) (_ bv0 32) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse94 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse95 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse93 (select (select (store |c_#memory_$Pointer$.base| .cse94 (store (store (select |c_#memory_$Pointer$.base| .cse94) v_arrayElimCell_136 (_ bv0 32)) .cse95 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse93) (= .cse94 .cse93) (= .cse95 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse96 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse96 (select (select (store |c_#memory_$Pointer$.base| .cse96 (store (store (select |c_#memory_$Pointer$.base| .cse96) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse82 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse98 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse97 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse97 (select (select (store |c_#memory_$Pointer$.base| .cse97 (store (store (select |c_#memory_$Pointer$.base| .cse97) v_arrayElimCell_136 (_ bv0 32)) .cse98 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse98 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse99 .cse100 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse102 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse103 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse101 (select (select (store |c_#memory_$Pointer$.base| .cse102 (store (store (select |c_#memory_$Pointer$.base| .cse102) v_arrayElimCell_136 (_ bv0 32)) .cse103 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse101) (= .cse102 .cse101) (= .cse103 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (let ((.cse104 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse104 (select (select (store |c_#memory_$Pointer$.base| .cse104 (store (store (select |c_#memory_$Pointer$.base| .cse104) v_arrayElimCell_136 (_ bv0 32)) .cse105 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= .cse105 (_ bv0 32))))) .cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse106 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse106 (select (select (store |c_#memory_$Pointer$.base| .cse106 (store (store (select |c_#memory_$Pointer$.base| .cse106) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse107) .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse109 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse108 (select (select (store |c_#memory_$Pointer$.base| .cse109 (store (store (select |c_#memory_$Pointer$.base| .cse109) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse108) (= .cse109 .cse108) (= .cse108 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse110 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse110 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= |c_ULTIMATE.start_main_~item~0#1.offset| v_arrayElimIndex_16))) (or .cse8 (and .cse76 .cse52 .cse111 .cse112 .cse68 .cse113)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse114 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse114 (store (store (select |c_#memory_$Pointer$.base| .cse114) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse53 .cse111 (or .cse8 .cse115) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse116 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse116 (store (store (select |c_#memory_$Pointer$.base| .cse116) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (or (and .cse31 .cse75 .cse80 .cse52 .cse82 .cse100 .cse53 .cse117) .cse8) (or .cse8 (and .cse46 .cse118)) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse119 (select (select (let ((.cse120 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse120 (store (store (select |c_#memory_$Pointer$.base| .cse120) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse119) (= .cse119 |c_ULTIMATE.start_main_~item~0#1.base|)))) (or .cse8 (and .cse100 .cse117)) (or .cse8 (and .cse58 .cse99)) .cse27 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse122 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse123 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse121 (select (select (store |c_#memory_$Pointer$.base| .cse122 (store (store (select |c_#memory_$Pointer$.base| .cse122) v_arrayElimCell_136 (_ bv0 32)) .cse123 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse121) (= .cse122 .cse121) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse123 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse124 (select (select (let ((.cse125 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse125 (store (store (select |c_#memory_$Pointer$.base| .cse125) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse124) (= .cse124 |c_ULTIMATE.start_main_~item~0#1.base|)))) .cse112 .cse68 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse126 (store (store (select |c_#memory_$Pointer$.base| .cse126) v_arrayElimCell_136 (_ bv0 32)) .cse127 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse127 (_ bv0 32))))) .cse28 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse128 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse128 (store (store (select |c_#memory_$Pointer$.base| .cse128) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse81 .cse12 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse130 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse129 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse129 (store (store (select |c_#memory_$Pointer$.base| .cse129) v_arrayElimCell_136 (_ bv0 32)) .cse130 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse130 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse118 (or .cse8 (and .cse75 .cse52 .cse82 .cse53)) (or (and (forall ((v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse131 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse131 (select (select (store |c_#memory_$Pointer$.base| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse7 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse132 (select (select (let ((.cse133 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse133 (store (store (select |c_#memory_$Pointer$.base| .cse133) (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse132 |c_ULTIMATE.start_main_~item~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse132)))) .cse11 .cse44 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) .cse2 .cse12) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse134 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse135 (select (select (store |c_#memory_$Pointer$.base| .cse134 (store (store (select |c_#memory_$Pointer$.base| .cse134) v_arrayElimCell_136 (_ bv0 32)) (bvadd v_arrayElimCell_136 (_ bv4 32)) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (not (= .cse134 .cse135)) (= .cse135 |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse137 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse138 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse136 (select (select (store |c_#memory_$Pointer$.base| .cse137 (store (store (select |c_#memory_$Pointer$.base| .cse137) v_arrayElimCell_136 (_ bv0 32)) .cse138 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse136) (= .cse137 .cse136) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse138) (= .cse138 (_ bv0 32)))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse139 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= .cse139 (_ bv0 32)) (= (select (select (let ((.cse140 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse140 (store (store (select |c_#memory_$Pointer$.base| .cse140) v_arrayElimCell_136 (_ bv0 32)) .cse139 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (or .cse12 (and .cse80 .cse52)) .cse113 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse142 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse143 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse141 (select (select (store |c_#memory_$Pointer$.base| .cse142 (store (store (select |c_#memory_$Pointer$.base| .cse142) v_arrayElimCell_136 (_ bv0 32)) .cse143 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse141) (= .cse142 .cse141) (= .cse143 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse141 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse117 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse145 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse144 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse144 (store (store (select |c_#memory_$Pointer$.base| .cse144) v_arrayElimCell_136 (_ bv0 32)) .cse145 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse145 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and .cse29 (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse146 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse146 (select (select (store |c_#memory_$Pointer$.base| .cse146 (store (store (select |c_#memory_$Pointer$.base| .cse146) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.offset| v_arrayElimIndex_16) (not (let ((.cse147 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse147 (select (select (store |c_#memory_$Pointer$.base| .cse147 (store (store (select |c_#memory_$Pointer$.base| .cse147) (bvadd (_ bv4294967292 32) v_arrayElimIndex_16) (_ bv0 32)) v_arrayElimIndex_16 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= (_ bv4 32) v_arrayElimIndex_16))) .cse148 .cse115) .cse12) (or .cse8 (and .cse31 .cse80)) .cse107 (or .cse8 .cse148))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse192 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse191 (select (select (store |c_#memory_$Pointer$.base| .cse192 (store (store (select |c_#memory_$Pointer$.base| .cse192) v_arrayElimIndex_16 (_ bv0 32)) (bvadd (_ bv4 32) v_arrayElimIndex_16) v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse191 |c_ULTIMATE.start_main_~item~0#1.base|) (= .cse192 .cse191) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse191))))))))) is different from true [2022-07-12 18:11:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:11:13,291 INFO L93 Difference]: Finished difference Result 248 states and 268 transitions. [2022-07-12 18:11:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:11:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-12 18:11:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:11:13,293 INFO L225 Difference]: With dead ends: 248 [2022-07-12 18:11:13,293 INFO L226 Difference]: Without dead ends: 248 [2022-07-12 18:11:13,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=81, Invalid=481, Unknown=6, NotChecked=188, Total=756 [2022-07-12 18:11:13,294 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 75 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 622 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:11:13,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1149 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 622 Unchecked, 4.9s Time] [2022-07-12 18:11:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-12 18:11:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2022-07-12 18:11:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 215 states have (on average 1.2372093023255815) internal successors, (266), 245 states have internal predecessors, (266), 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) [2022-07-12 18:11:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 266 transitions. [2022-07-12 18:11:13,299 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 266 transitions. Word has length 44 [2022-07-12 18:11:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:11:13,299 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 266 transitions. [2022-07-12 18:11:13,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:11:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 266 transitions. [2022-07-12 18:11:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:11:13,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:11:13,300 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:11:13,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-12 18:11:13,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:11:13,509 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:11:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:11:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash 813102997, now seen corresponding path program 1 times [2022-07-12 18:11:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:11:13,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687308380] [2022-07-12 18:11:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:11:13,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:11:13,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:11:13,512 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:11:13,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 18:11:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:11:13,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:11:13,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:11:13,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:11:14,286 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:11:14,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:11:14,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:11:15,802 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:11:15,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 18:11:16,180 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:11:16,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 18:11:16,795 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:11:16,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:11:17,340 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:11:17,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-12 18:11:19,107 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 18:11:19,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2022-07-12 18:11:19,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-12 18:11:20,476 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 18:11:20,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-07-12 18:11:20,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-07-12 18:11:21,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2022-07-12 18:11:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:11:22,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:11:23,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-07-12 18:11:23,511 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-07-12 18:11:23,657 INFO L356 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2022-07-12 18:11:23,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 25 [2022-07-12 18:11:23,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~item~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2022-07-12 18:11:23,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) is different from false [2022-07-12 18:11:25,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:11:25,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-07-12 18:11:25,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_16 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_16) .cse0 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) is different from false [2022-07-12 18:11:25,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_16 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_16) .cse0 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|)))) is different from false [2022-07-12 18:11:25,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_91| (_ BitVec 32)) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_16 |v_ULTIMATE.start_main_~item~0#1.offset_91|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_16) .cse1 v_ArrVal_948) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) is different from false [2022-07-12 18:11:25,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:11:25,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-07-12 18:11:26,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:11:26,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 71 [2022-07-12 18:11:26,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:11:26,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 60 [2022-07-12 18:11:26,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 42 [2022-07-12 18:11:26,349 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:11:26,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 [2022-07-12 18:11:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 18:11:27,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:11:27,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687308380] [2022-07-12 18:11:27,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687308380] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:11:27,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:11:27,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-07-12 18:11:27,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255531988] [2022-07-12 18:11:27,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:11:27,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 18:11:27,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:11:27,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 18:11:27,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=255, Unknown=15, NotChecked=266, Total=600 [2022-07-12 18:11:27,851 INFO L87 Difference]: Start difference. First operand 246 states and 266 transitions. Second operand has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 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) [2022-07-12 18:11:43,495 WARN L233 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 32 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:11:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:11:52,838 INFO L93 Difference]: Finished difference Result 283 states and 306 transitions. [2022-07-12 18:11:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:11:52,839 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 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 44 [2022-07-12 18:11:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:11:52,840 INFO L225 Difference]: With dead ends: 283 [2022-07-12 18:11:52,840 INFO L226 Difference]: Without dead ends: 283 [2022-07-12 18:11:52,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 61 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=138, Invalid=624, Unknown=22, NotChecked=406, Total=1190 [2022-07-12 18:11:52,841 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 199 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1291 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:11:52,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1073 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 618 Invalid, 0 Unknown, 1291 Unchecked, 8.5s Time] [2022-07-12 18:11:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-12 18:11:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 249. [2022-07-12 18:11:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 218 states have (on average 1.238532110091743) internal successors, (270), 248 states have internal predecessors, (270), 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) [2022-07-12 18:11:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 270 transitions. [2022-07-12 18:11:52,844 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 270 transitions. Word has length 44 [2022-07-12 18:11:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:11:52,844 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 270 transitions. [2022-07-12 18:11:52,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 25 states have internal predecessors, (83), 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) [2022-07-12 18:11:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 270 transitions. [2022-07-12 18:11:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:11:52,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:11:52,844 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:11:52,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 18:11:53,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:11:53,052 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:11:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:11:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash 813102998, now seen corresponding path program 1 times [2022-07-12 18:11:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:11:53,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346350538] [2022-07-12 18:11:53,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:11:53,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:11:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:11:53,068 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:11:53,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 18:11:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:11:53,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 18:11:53,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:11:53,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:11:53,693 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:11:53,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:11:53,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:11:54,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:11:55,370 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:11:55,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 18:11:55,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:11:55,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 21 [2022-07-12 18:11:55,785 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:11:55,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 22 [2022-07-12 18:11:55,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:11:55,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 21 [2022-07-12 18:11:56,672 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:11:56,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:11:57,251 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:11:57,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-07-12 18:11:57,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 18:11:59,287 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 18:11:59,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2022-07-12 18:11:59,479 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:11:59,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 44 [2022-07-12 18:11:59,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 8 [2022-07-12 18:12:00,944 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 18:12:00,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 70 [2022-07-12 18:12:01,138 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 18:12:01,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 53 [2022-07-12 18:12:01,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-07-12 18:12:02,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 19 [2022-07-12 18:12:03,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 14 [2022-07-12 18:12:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:12:03,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:12:05,397 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-12 18:12:05,724 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-12 18:12:05,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:05,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 70 [2022-07-12 18:12:06,280 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-12 18:12:06,573 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (_ bv0 32))) (forall ((v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-12 18:12:06,872 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1)))))) is different from false [2022-07-12 18:12:08,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:08,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 20 [2022-07-12 18:12:08,243 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) .cse1 v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_18) .cse1 v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv4 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1)))))) is different from false [2022-07-12 18:12:08,982 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_18 |c_ULTIMATE.start_main_#t~mem4#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse1))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1013) .cse1 v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_18) .cse1 v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))) (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~mem4#1.offset|)))))) is different from false [2022-07-12 18:12:09,251 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_44| (_ BitVec 32))) (or (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1013) |v_ULTIMATE.start_main_#t~malloc3#1.base_44| v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_44|) (_ bv0 1))))) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse1 (select v_arrayElimArr_18 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) (or (not (= (_ bv0 1) (select |c_#valid| .cse1))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_18) .cse1 v_ArrVal_1018) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1013) .cse1 v_ArrVal_1017) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)))))) is different from false [2022-07-12 18:12:09,550 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:09,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 34 [2022-07-12 18:12:09,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:09,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 149 [2022-07-12 18:12:09,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 126 [2022-07-12 18:12:09,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 110 [2022-07-12 18:12:10,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:10,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 26 [2022-07-12 18:12:10,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:12:10,763 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:10,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 41 [2022-07-12 18:12:10,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 11 [2022-07-12 18:12:11,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:11,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 26 [2022-07-12 18:12:11,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:11,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 24 [2022-07-12 18:12:11,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:12:11,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:11,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2022-07-12 18:12:11,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:12:11,622 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:11,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2022-07-12 18:12:11,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-07-12 18:12:11,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:11,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-07-12 18:12:16,917 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:12:16,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 149 treesize of output 489 [2022-07-12 18:12:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-12 18:12:24,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:12:24,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346350538] [2022-07-12 18:12:24,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346350538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:12:24,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:12:24,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-12 18:12:24,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106420253] [2022-07-12 18:12:24,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:12:24,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 18:12:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:12:24,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 18:12:24,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=297, Unknown=8, NotChecked=328, Total=702 [2022-07-12 18:12:24,531 INFO L87 Difference]: Start difference. First operand 249 states and 270 transitions. Second operand has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 27 states have internal predecessors, (84), 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) [2022-07-12 18:12:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:12:45,108 INFO L93 Difference]: Finished difference Result 284 states and 307 transitions. [2022-07-12 18:12:45,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:12:45,110 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 27 states have internal predecessors, (84), 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 44 [2022-07-12 18:12:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:12:45,111 INFO L225 Difference]: With dead ends: 284 [2022-07-12 18:12:45,111 INFO L226 Difference]: Without dead ends: 284 [2022-07-12 18:12:45,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=140, Invalid=695, Unknown=9, NotChecked=488, Total=1332 [2022-07-12 18:12:45,112 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 230 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1414 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:12:45,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1041 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 779 Invalid, 0 Unknown, 1414 Unchecked, 10.6s Time] [2022-07-12 18:12:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-12 18:12:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 249. [2022-07-12 18:12:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 248 states have internal predecessors, (269), 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) [2022-07-12 18:12:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 269 transitions. [2022-07-12 18:12:45,114 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 269 transitions. Word has length 44 [2022-07-12 18:12:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:12:45,114 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 269 transitions. [2022-07-12 18:12:45,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 27 states have internal predecessors, (84), 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) [2022-07-12 18:12:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2022-07-12 18:12:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:12:45,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:12:45,115 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:12:45,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-12 18:12:45,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:12:45,332 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-07-12 18:12:45,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:12:45,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1823961394, now seen corresponding path program 2 times [2022-07-12 18:12:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:12:45,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280246462] [2022-07-12 18:12:45,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:12:45,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:12:45,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:12:45,336 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:12:45,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-12 18:12:45,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:12:45,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:12:45,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 18:12:45,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:12:45,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:12:45,963 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:12:45,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:12:46,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-12 18:12:46,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-07-12 18:12:47,388 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 18:12:47,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 26 [2022-07-12 18:12:47,667 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 18:12:47,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-07-12 18:12:48,580 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-12 18:12:48,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2022-07-12 18:12:48,746 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-12 18:12:48,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-12 18:12:52,456 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 18:12:52,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 36 [2022-07-12 18:12:52,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-12 18:12:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:12:53,438 INFO L328 TraceCheckSpWp]: Computing backward predicates...