./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 791161d1 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-?-791161d [2022-07-23 05:25:42,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:25:42,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:25:43,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:25:43,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:25:43,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:25:43,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:25:43,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:25:43,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:25:43,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:25:43,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:25:43,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:25:43,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:25:43,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:25:43,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:25:43,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:25:43,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:25:43,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:25:43,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:25:43,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:25:43,015 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:25:43,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:25:43,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:25:43,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:25:43,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:25:43,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:25:43,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:25:43,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:25:43,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:25:43,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:25:43,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:25:43,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:25:43,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:25:43,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:25:43,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:25:43,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:25:43,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:25:43,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:25:43,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:25:43,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:25:43,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:25:43,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:25:43,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-23 05:25:43,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:25:43,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:25:43,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:25:43,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:25:43,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:25:43,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:25:43,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:25:43,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:25:43,073 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:25:43,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:25:43,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:25:43,074 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:25:43,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:25:43,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:25:43,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:25:43,075 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:25:43,075 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:25:43,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:25:43,076 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:25:43,076 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:25:43,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:25:43,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:25:43,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:25:43,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:25:43,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:25:43,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:25:43,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:25:43,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:25:43,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:25:43,078 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-23 05:25:43,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:25:43,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:25:43,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:25:43,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:25:43,314 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:25:43,316 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-23 05:25:43,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11d138b5/1b1b67ecb2e24ccaaa8da5c49cc2b67e/FLAG03f8768d0 [2022-07-23 05:25:43,755 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:25:43,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-23 05:25:43,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11d138b5/1b1b67ecb2e24ccaaa8da5c49cc2b67e/FLAG03f8768d0 [2022-07-23 05:25:44,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c11d138b5/1b1b67ecb2e24ccaaa8da5c49cc2b67e [2022-07-23 05:25:44,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:25:44,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:25:44,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:25:44,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:25:44,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:25:44,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1403f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44, skipping insertion in model container [2022-07-23 05:25:44,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:25:44,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:25:44,455 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-23 05:25:44,458 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-23 05:25:44,459 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-23 05:25:44,461 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-23 05:25:44,462 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-23 05:25:44,464 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-23 05:25:44,465 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-23 05:25:44,466 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-23 05:25:44,467 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-23 05:25:44,469 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-23 05:25:44,470 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-23 05:25:44,471 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-23 05:25:44,473 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-23 05:25:44,474 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-23 05:25:44,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:25:44,487 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:25:44,518 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-23 05:25:44,520 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-23 05:25:44,522 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-23 05:25:44,523 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-23 05:25:44,526 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-23 05:25:44,527 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-23 05:25:44,528 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-23 05:25:44,537 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-23 05:25:44,539 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-23 05:25:44,542 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-23 05:25:44,543 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-23 05:25:44,544 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-23 05:25:44,545 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-23 05:25:44,547 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-23 05:25:44,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:25:44,581 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:25:44,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44 WrapperNode [2022-07-23 05:25:44,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:25:44,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:25:44,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:25:44,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:25:44,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,648 INFO L137 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 222 [2022-07-23 05:25:44,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:25:44,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:25:44,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:25:44,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:25:44,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:25:44,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:25:44,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:25:44,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:25:44,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (1/1) ... [2022-07-23 05:25:44,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:25:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:44,716 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-23 05:25:44,720 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-23 05:25:44,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 05:25:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 05:25:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:25:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:25:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:25:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:25:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:25:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 05:25:44,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:25:44,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:25:44,838 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:25:44,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:25:45,239 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:25:45,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:25:45,249 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-23 05:25:45,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:25:45 BoogieIcfgContainer [2022-07-23 05:25:45,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:25:45,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:25:45,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:25:45,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:25:45,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:25:44" (1/3) ... [2022-07-23 05:25:45,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3cd57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:25:45, skipping insertion in model container [2022-07-23 05:25:45,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:25:44" (2/3) ... [2022-07-23 05:25:45,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3cd57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:25:45, skipping insertion in model container [2022-07-23 05:25:45,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:25:45" (3/3) ... [2022-07-23 05:25:45,260 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2022-07-23 05:25:45,271 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:25:45,272 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-23 05:25:45,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:25:45,323 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@3e234b29, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c88b37f [2022-07-23 05:25:45,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-23 05:25:45,327 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-23 05:25:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:25:45,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:45,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:25:45,334 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-23 05:25:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 05:25:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:45,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681599559] [2022-07-23 05:25:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:45,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:45,491 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-23 05:25:45,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:45,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681599559] [2022-07-23 05:25:45,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681599559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:45,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:45,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:25:45,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232203847] [2022-07-23 05:25:45,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:45,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:45,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:45,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:45,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:45,521 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-23 05:25:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:45,655 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-07-23 05:25:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:45,657 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-23 05:25:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:45,663 INFO L225 Difference]: With dead ends: 169 [2022-07-23 05:25:45,663 INFO L226 Difference]: Without dead ends: 165 [2022-07-23 05:25:45,665 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-23 05:25:45,667 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-23 05:25:45,667 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-23 05:25:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-23 05:25:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2022-07-23 05:25:45,698 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-23 05:25:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-07-23 05:25:45,700 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 3 [2022-07-23 05:25:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:45,700 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-07-23 05:25:45,700 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-23 05:25:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-07-23 05:25:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:25:45,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:45,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:25:45,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:25:45,701 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-23 05:25:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 05:25:45,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:45,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519762384] [2022-07-23 05:25:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:45,744 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-23 05:25:45,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:45,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519762384] [2022-07-23 05:25:45,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519762384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:45,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:45,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:25:45,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443970132] [2022-07-23 05:25:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:45,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:45,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:45,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:45,760 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-23 05:25:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:45,849 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-23 05:25:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:45,853 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-23 05:25:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:45,857 INFO L225 Difference]: With dead ends: 155 [2022-07-23 05:25:45,857 INFO L226 Difference]: Without dead ends: 155 [2022-07-23 05:25:45,857 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-23 05:25:45,859 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-23 05:25:45,861 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-23 05:25:45,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-23 05:25:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-23 05:25:45,872 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-23 05:25:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-07-23 05:25:45,876 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-07-23 05:25:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:45,876 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-07-23 05:25:45,877 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-23 05:25:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-07-23 05:25:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 05:25:45,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:45,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:45,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:25:45,878 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-23 05:25:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-07-23 05:25:45,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:45,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536569277] [2022-07-23 05:25:45,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:45,952 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-23 05:25:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:45,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536569277] [2022-07-23 05:25:45,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536569277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:45,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:45,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44964784] [2022-07-23 05:25:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:45,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:25:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:25:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:25:45,954 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-23 05:25:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:46,058 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-07-23 05:25:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:25:46,059 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-23 05:25:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:46,060 INFO L225 Difference]: With dead ends: 161 [2022-07-23 05:25:46,060 INFO L226 Difference]: Without dead ends: 161 [2022-07-23 05:25:46,060 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-23 05:25:46,063 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-23 05:25:46,064 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-23 05:25:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-23 05:25:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2022-07-23 05:25:46,078 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-23 05:25:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2022-07-23 05:25:46,079 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 8 [2022-07-23 05:25:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:46,079 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2022-07-23 05:25:46,079 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-23 05:25:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2022-07-23 05:25:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 05:25:46,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:46,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:46,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:25:46,082 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-23 05:25:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-07-23 05:25:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:46,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588690877] [2022-07-23 05:25:46,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:46,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:46,130 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-23 05:25:46,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:46,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588690877] [2022-07-23 05:25:46,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588690877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:46,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:46,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:46,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070904665] [2022-07-23 05:25:46,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:46,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:25:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:46,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:25:46,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:25:46,132 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-23 05:25:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:46,304 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2022-07-23 05:25:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:25:46,305 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-23 05:25:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:46,306 INFO L225 Difference]: With dead ends: 244 [2022-07-23 05:25:46,306 INFO L226 Difference]: Without dead ends: 244 [2022-07-23 05:25:46,306 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-23 05:25:46,307 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:46,307 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.2s Time] [2022-07-23 05:25:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-23 05:25:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2022-07-23 05:25:46,310 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-23 05:25:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2022-07-23 05:25:46,311 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 8 [2022-07-23 05:25:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:46,311 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2022-07-23 05:25:46,311 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-23 05:25:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2022-07-23 05:25:46,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 05:25:46,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:46,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:46,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:25:46,312 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-23 05:25:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1837174119, now seen corresponding path program 1 times [2022-07-23 05:25:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:46,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981437690] [2022-07-23 05:25:46,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:46,335 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-23 05:25:46,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:46,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981437690] [2022-07-23 05:25:46,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981437690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:46,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:46,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:46,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414686056] [2022-07-23 05:25:46,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:46,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:46,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:46,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:46,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:46,337 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-23 05:25:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:46,357 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2022-07-23 05:25:46,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:46,357 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-23 05:25:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:46,358 INFO L225 Difference]: With dead ends: 148 [2022-07-23 05:25:46,358 INFO L226 Difference]: Without dead ends: 148 [2022-07-23 05:25:46,358 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-23 05:25:46,359 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-23 05:25:46,359 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-23 05:25:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-23 05:25:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-23 05:25:46,362 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-23 05:25:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2022-07-23 05:25:46,362 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 9 [2022-07-23 05:25:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:46,362 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2022-07-23 05:25:46,363 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-23 05:25:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2022-07-23 05:25:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:25:46,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:46,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:46,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:25:46,363 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-23 05:25:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-23 05:25:46,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:46,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999695488] [2022-07-23 05:25:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:46,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:46,409 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-23 05:25:46,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:46,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999695488] [2022-07-23 05:25:46,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999695488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:46,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:46,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:25:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082768531] [2022-07-23 05:25:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:46,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:46,410 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-23 05:25:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:46,606 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2022-07-23 05:25:46,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:25:46,607 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-23 05:25:46,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:46,608 INFO L225 Difference]: With dead ends: 219 [2022-07-23 05:25:46,608 INFO L226 Difference]: Without dead ends: 219 [2022-07-23 05:25:46,608 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-23 05:25:46,608 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-23 05:25:46,609 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-23 05:25:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-23 05:25:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 147. [2022-07-23 05:25:46,611 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-23 05:25:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-23 05:25:46,612 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 12 [2022-07-23 05:25:46,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:46,612 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-23 05:25:46,612 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-23 05:25:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-23 05:25:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 05:25:46,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:46,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:46,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:25:46,613 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-23 05:25:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:46,613 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-23 05:25:46,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:46,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884944787] [2022-07-23 05:25:46,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:46,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:46,729 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-23 05:25:46,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:46,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884944787] [2022-07-23 05:25:46,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884944787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:46,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:46,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:25:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497858823] [2022-07-23 05:25:46,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:46,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:46,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:46,730 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-23 05:25:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:46,955 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2022-07-23 05:25:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:25:46,955 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-23 05:25:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:46,956 INFO L225 Difference]: With dead ends: 211 [2022-07-23 05:25:46,956 INFO L226 Difference]: Without dead ends: 211 [2022-07-23 05:25:46,956 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-23 05:25:46,957 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:46,957 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.2s Time] [2022-07-23 05:25:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-23 05:25:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 136. [2022-07-23 05:25:46,959 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-23 05:25:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-23 05:25:46,960 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 12 [2022-07-23 05:25:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:46,960 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-23 05:25:46,960 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-23 05:25:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-23 05:25:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:25:46,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:46,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:25:46,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 05:25:46,962 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-23 05:25:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1603335132, now seen corresponding path program 1 times [2022-07-23 05:25:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:46,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118792353] [2022-07-23 05:25:46,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:46,982 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-23 05:25:46,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:46,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118792353] [2022-07-23 05:25:46,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118792353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:46,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:46,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:46,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843479419] [2022-07-23 05:25:46,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:46,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:46,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:46,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:46,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:46,984 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-23 05:25:47,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:47,009 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-07-23 05:25:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:47,010 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-23 05:25:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:47,010 INFO L225 Difference]: With dead ends: 191 [2022-07-23 05:25:47,010 INFO L226 Difference]: Without dead ends: 191 [2022-07-23 05:25:47,011 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-23 05:25:47,012 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-23 05:25:47,012 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-23 05:25:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-23 05:25:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2022-07-23 05:25:47,015 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-23 05:25:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-07-23 05:25:47,015 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 15 [2022-07-23 05:25:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:47,016 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-07-23 05:25:47,016 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-23 05:25:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-07-23 05:25:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:25:47,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:47,017 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-23 05:25:47,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:25:47,017 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-23 05:25:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash -775737061, now seen corresponding path program 1 times [2022-07-23 05:25:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:47,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844841412] [2022-07-23 05:25:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:47,058 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-23 05:25:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844841412] [2022-07-23 05:25:47,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844841412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:47,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:47,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:25:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991543977] [2022-07-23 05:25:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:47,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:47,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:47,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:47,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:47,060 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-23 05:25:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:47,132 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2022-07-23 05:25:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:25:47,133 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-23 05:25:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:47,134 INFO L225 Difference]: With dead ends: 149 [2022-07-23 05:25:47,134 INFO L226 Difference]: Without dead ends: 149 [2022-07-23 05:25:47,134 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-23 05:25:47,135 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.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:47,135 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.0s Time] [2022-07-23 05:25:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-23 05:25:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-07-23 05:25:47,137 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-23 05:25:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2022-07-23 05:25:47,138 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 19 [2022-07-23 05:25:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:47,138 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2022-07-23 05:25:47,138 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-23 05:25:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-07-23 05:25:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 05:25:47,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:47,139 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-23 05:25:47,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 05:25:47,139 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-23 05:25:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash 73317399, now seen corresponding path program 1 times [2022-07-23 05:25:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:47,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720360299] [2022-07-23 05:25:47,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:47,189 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-23 05:25:47,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:47,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720360299] [2022-07-23 05:25:47,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720360299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:47,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:47,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:25:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219719148] [2022-07-23 05:25:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:47,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:47,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:47,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:47,191 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-23 05:25:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:47,273 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-23 05:25:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:25:47,273 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-23 05:25:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:47,274 INFO L225 Difference]: With dead ends: 156 [2022-07-23 05:25:47,274 INFO L226 Difference]: Without dead ends: 156 [2022-07-23 05:25:47,274 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-23 05:25:47,275 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-23 05:25:47,275 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-23 05:25:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-23 05:25:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-23 05:25:47,277 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-23 05:25:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-23 05:25:47,278 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 20 [2022-07-23 05:25:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:47,278 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-23 05:25:47,278 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-23 05:25:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-23 05:25:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 05:25:47,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:47,279 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-23 05:25:47,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 05:25:47,279 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-23 05:25:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash -800612379, now seen corresponding path program 1 times [2022-07-23 05:25:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:47,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259636014] [2022-07-23 05:25:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:47,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:47,311 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-23 05:25:47,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:47,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259636014] [2022-07-23 05:25:47,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259636014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:47,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:47,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:25:47,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704136185] [2022-07-23 05:25:47,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:47,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:25:47,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:25:47,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:25:47,313 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-23 05:25:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:47,378 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-07-23 05:25:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:25:47,379 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-23 05:25:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:47,380 INFO L225 Difference]: With dead ends: 152 [2022-07-23 05:25:47,380 INFO L226 Difference]: Without dead ends: 152 [2022-07-23 05:25:47,380 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-23 05:25:47,380 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-23 05:25:47,381 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-23 05:25:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-23 05:25:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-23 05:25:47,383 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-23 05:25:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-07-23 05:25:47,383 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 22 [2022-07-23 05:25:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:47,383 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-07-23 05:25:47,384 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-23 05:25:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-07-23 05:25:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 05:25:47,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:47,384 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-23 05:25:47,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:25:47,385 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-23 05:25:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1089542561, now seen corresponding path program 1 times [2022-07-23 05:25:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:47,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190427563] [2022-07-23 05:25:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:47,427 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-23 05:25:47,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:47,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190427563] [2022-07-23 05:25:47,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190427563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:47,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585056994] [2022-07-23 05:25:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:47,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:47,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:47,429 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-23 05:25:47,446 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-23 05:25:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:47,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-23 05:25:47,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:47,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 15 treesize of output 7 [2022-07-23 05:25:47,673 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-23 05:25:47,696 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-23 05:25:47,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:47,782 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-23 05:25:47,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585056994] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:47,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:47,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2022-07-23 05:25:47,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483206091] [2022-07-23 05:25:47,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:47,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:25:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:47,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:25:47,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:25:47,788 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-23 05:25:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:48,017 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2022-07-23 05:25:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:25:48,017 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-23 05:25:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:48,018 INFO L225 Difference]: With dead ends: 181 [2022-07-23 05:25:48,018 INFO L226 Difference]: Without dead ends: 181 [2022-07-23 05:25:48,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-07-23 05:25:48,019 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-23 05:25:48,019 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-23 05:25:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-23 05:25:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2022-07-23 05:25:48,021 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-23 05:25:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2022-07-23 05:25:48,021 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 25 [2022-07-23 05:25:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:48,021 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2022-07-23 05:25:48,022 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-23 05:25:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2022-07-23 05:25:48,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:25:48,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:48,022 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-23 05:25:48,044 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-23 05:25:48,235 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-23 05:25:48,236 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-23 05:25:48,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 583917852, now seen corresponding path program 1 times [2022-07-23 05:25:48,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:48,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103133349] [2022-07-23 05:25:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:48,291 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-23 05:25:48,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103133349] [2022-07-23 05:25:48,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103133349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777188600] [2022-07-23 05:25:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:48,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:48,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:48,294 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-23 05:25:48,295 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-23 05:25:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:48,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:25:48,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:48,396 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-23 05:25:48,416 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-23 05:25:48,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:48,443 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-23 05:25:48,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777188600] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:48,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:48,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-23 05:25:48,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668558618] [2022-07-23 05:25:48,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:48,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:25:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:48,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:25:48,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:25:48,445 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-23 05:25:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:48,537 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2022-07-23 05:25:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:25:48,537 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-23 05:25:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:48,538 INFO L225 Difference]: With dead ends: 172 [2022-07-23 05:25:48,538 INFO L226 Difference]: Without dead ends: 153 [2022-07-23 05:25:48,538 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-23 05:25:48,539 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-23 05:25:48,539 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-23 05:25:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-23 05:25:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-23 05:25:48,542 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-23 05:25:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2022-07-23 05:25:48,542 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 26 [2022-07-23 05:25:48,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:48,542 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2022-07-23 05:25:48,542 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-23 05:25:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2022-07-23 05:25:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 05:25:48,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:48,545 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-23 05:25:48,569 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-23 05:25:48,759 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-23 05:25:48,759 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-23 05:25:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash -370767273, now seen corresponding path program 1 times [2022-07-23 05:25:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:48,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676646423] [2022-07-23 05:25:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:48,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:48,896 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-23 05:25:48,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:48,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676646423] [2022-07-23 05:25:48,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676646423] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:48,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219669101] [2022-07-23 05:25:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:48,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:48,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:48,898 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-23 05:25:48,899 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-23 05:25:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:48,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 05:25:48,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:48,972 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-23 05:25:49,032 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:25:49,032 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-23 05:25:49,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, 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-23 05:25:49,156 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:49,156 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-23 05:25:49,180 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:49,181 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-23 05:25:49,249 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-23 05:25:49,251 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-23 05:25:49,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:49,270 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-23 05:25:49,281 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-23 05:25:49,285 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-23 05:25:49,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:49,294 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-23 05:25:49,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:49,300 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-23 05:25:49,303 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-23 05:25:49,422 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-23 05:25:49,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219669101] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:49,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:49,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-23 05:25:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348503359] [2022-07-23 05:25:49,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:49,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 05:25:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 05:25:49,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=363, Unknown=3, NotChecked=120, Total=552 [2022-07-23 05:25:49,425 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-23 05:25:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:50,055 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2022-07-23 05:25:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:25:50,055 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-23 05:25:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:50,056 INFO L225 Difference]: With dead ends: 281 [2022-07-23 05:25:50,056 INFO L226 Difference]: Without dead ends: 281 [2022-07-23 05:25:50,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=749, Unknown=3, NotChecked=180, Total=1122 [2022-07-23 05:25:50,057 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 527 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-23 05:25:50,057 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-23 05:25:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-23 05:25:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 168. [2022-07-23 05:25:50,059 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-23 05:25:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2022-07-23 05:25:50,060 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 29 [2022-07-23 05:25:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:50,060 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2022-07-23 05:25:50,060 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-23 05:25:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-07-23 05:25:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 05:25:50,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:50,060 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-23 05:25:50,089 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-23 05:25:50,267 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-23 05:25:50,267 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-23 05:25:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:50,268 INFO L85 PathProgramCache]: Analyzing trace with hash -751968760, now seen corresponding path program 1 times [2022-07-23 05:25:50,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:50,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338500935] [2022-07-23 05:25:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:50,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:50,304 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-23 05:25:50,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:50,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338500935] [2022-07-23 05:25:50,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338500935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:50,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:50,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:50,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284530906] [2022-07-23 05:25:50,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:50,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:50,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:50,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:50,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:50,305 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-23 05:25:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:50,322 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2022-07-23 05:25:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:50,322 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-23 05:25:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:50,323 INFO L225 Difference]: With dead ends: 239 [2022-07-23 05:25:50,323 INFO L226 Difference]: Without dead ends: 239 [2022-07-23 05:25:50,323 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-23 05:25:50,324 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-23 05:25:50,324 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-23 05:25:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-23 05:25:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 186. [2022-07-23 05:25:50,326 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-23 05:25:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2022-07-23 05:25:50,326 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 30 [2022-07-23 05:25:50,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:50,326 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2022-07-23 05:25:50,326 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-23 05:25:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2022-07-23 05:25:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 05:25:50,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:50,327 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-23 05:25:50,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 05:25:50,327 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-23 05:25:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046208, now seen corresponding path program 1 times [2022-07-23 05:25:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:50,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504230662] [2022-07-23 05:25:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:50,491 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-23 05:25:50,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:50,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504230662] [2022-07-23 05:25:50,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504230662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:50,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822301970] [2022-07-23 05:25:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:50,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:50,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:50,492 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-23 05:25:50,494 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-23 05:25:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:50,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 05:25:50,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:50,574 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-23 05:25:50,621 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:25:50,621 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-23 05:25:50,651 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-23 05:25:50,733 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:50,734 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-23 05:25:50,773 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:50,773 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-23 05:25:50,881 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-23 05:25:50,945 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-23 05:25:50,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:50,984 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-23 05:25:51,018 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-23 05:25:51,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:51,026 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-23 05:25:51,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:51,031 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-23 05:25:51,038 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-23 05:25:55,195 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-23 05:25:55,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822301970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:55,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:55,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2022-07-23 05:25:55,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480807253] [2022-07-23 05:25:55,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:55,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-23 05:25:55,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:55,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 05:25:55,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=611, Unknown=11, NotChecked=106, Total=870 [2022-07-23 05:25:55,197 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-23 05:25:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:55,791 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2022-07-23 05:25:55,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:25:55,791 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-23 05:25:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:55,792 INFO L225 Difference]: With dead ends: 247 [2022-07-23 05:25:55,792 INFO L226 Difference]: Without dead ends: 247 [2022-07-23 05:25:55,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=344, Invalid=1293, Unknown=11, NotChecked=158, Total=1806 [2022-07-23 05:25:55,793 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:25:55,793 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.3s Time] [2022-07-23 05:25:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-23 05:25:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 197. [2022-07-23 05:25:55,795 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-23 05:25:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2022-07-23 05:25:55,796 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 39 [2022-07-23 05:25:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:55,796 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2022-07-23 05:25:55,796 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-23 05:25:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2022-07-23 05:25:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 05:25:55,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:55,796 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-23 05:25:55,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-23 05:25:56,007 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-23 05:25:56,007 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-23 05:25:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:56,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046209, now seen corresponding path program 1 times [2022-07-23 05:25:56,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:56,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577111953] [2022-07-23 05:25:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:56,198 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-23 05:25:56,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:56,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577111953] [2022-07-23 05:25:56,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577111953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:56,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871559485] [2022-07-23 05:25:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:56,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:56,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:56,200 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-23 05:25:56,200 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-23 05:25:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:56,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 05:25:56,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:56,304 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-23 05:25:56,378 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:25:56,381 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-23 05:25:56,392 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-23 05:25:56,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, 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-23 05:25:56,430 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-23 05:25:56,539 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:25:56,540 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-23 05:25:56,544 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-23 05:25:56,553 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:56,554 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-23 05:25:56,592 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:56,592 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-23 05:25:56,595 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-23 05:25:56,719 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-23 05:25:56,722 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-23 05:25:56,769 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-23 05:25:56,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:56,899 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-23 05:25:56,919 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-23 05:25:56,927 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-23 05:25:56,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:56,939 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-23 05:25:56,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:56,945 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-23 05:25:56,948 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-23 05:25:56,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:56,962 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-23 05:25:56,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:56,966 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-23 05:25:56,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:56,970 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-23 05:25:56,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:56,973 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-23 05:25:57,060 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-23 05:25:57,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871559485] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:25:57,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:25:57,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2022-07-23 05:25:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397167199] [2022-07-23 05:25:57,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:25:57,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-23 05:25:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-23 05:25:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-07-23 05:25:57,062 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-23 05:25:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:58,554 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2022-07-23 05:25:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 05:25:58,559 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-23 05:25:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:58,560 INFO L225 Difference]: With dead ends: 325 [2022-07-23 05:25:58,560 INFO L226 Difference]: Without dead ends: 325 [2022-07-23 05:25:58,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=471, Invalid=2294, Unknown=3, NotChecked=312, Total=3080 [2022-07-23 05:25:58,562 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-23 05:25:58,562 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-23 05:25:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-23 05:25:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 201. [2022-07-23 05:25:58,565 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-23 05:25:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2022-07-23 05:25:58,565 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 39 [2022-07-23 05:25:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:58,565 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2022-07-23 05:25:58,566 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-23 05:25:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2022-07-23 05:25:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 05:25:58,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:58,566 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-23 05:25:58,585 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-23 05:25:58,785 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-23 05:25:58,785 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-23 05:25:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1519790839, now seen corresponding path program 1 times [2022-07-23 05:25:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:58,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050282844] [2022-07-23 05:25:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:58,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:58,820 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-23 05:25:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:58,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050282844] [2022-07-23 05:25:58,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050282844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:25:58,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:25:58,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:25:58,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116702955] [2022-07-23 05:25:58,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:25:58,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:25:58,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:25:58,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:25:58,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:25:58,823 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-23 05:25:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:25:58,828 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2022-07-23 05:25:58,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:25:58,828 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-23 05:25:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:25:58,829 INFO L225 Difference]: With dead ends: 202 [2022-07-23 05:25:58,829 INFO L226 Difference]: Without dead ends: 202 [2022-07-23 05:25:58,829 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-23 05:25:58,830 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-23 05:25:58,830 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-23 05:25:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-23 05:25:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-23 05:25:58,832 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-23 05:25:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2022-07-23 05:25:58,833 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 40 [2022-07-23 05:25:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:25:58,833 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2022-07-23 05:25:58,833 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-23 05:25:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2022-07-23 05:25:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 05:25:58,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:25:58,834 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-23 05:25:58,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 05:25:58,835 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-23 05:25:58,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:25:58,835 INFO L85 PathProgramCache]: Analyzing trace with hash 231761564, now seen corresponding path program 1 times [2022-07-23 05:25:58,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:25:58,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425069267] [2022-07-23 05:25:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:58,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:25:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:59,125 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-23 05:25:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:25:59,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425069267] [2022-07-23 05:25:59,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425069267] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:25:59,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317667274] [2022-07-23 05:25:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:25:59,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:25:59,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:25:59,128 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-23 05:25:59,129 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-23 05:25:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:25:59,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-23 05:25:59,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:25:59,212 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-23 05:25:59,235 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:25:59,235 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-23 05:25:59,242 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-23 05:25:59,265 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-23 05:25:59,273 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-23 05:25:59,376 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:59,376 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-23 05:25:59,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:25:59,384 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-23 05:25:59,469 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:25:59,470 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-23 05:25:59,476 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-23 05:25:59,483 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-23 05:25:59,492 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-23 05:25:59,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 29 treesize of output 17 [2022-07-23 05:25:59,718 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-23 05:25:59,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:25:59,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:25:59,798 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-23 05:25:59,811 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-23 05:25:59,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:25:59,922 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-23 05:26:00,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:00,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, 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-23 05:26:00,167 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:00,168 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-23 05:26:00,171 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-23 05:26:00,184 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:26:00,184 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-23 05:26:00,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:00,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, 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-23 05:26:00,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:00,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:00,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:00,199 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-23 05:26:00,305 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-23 05:26:00,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317667274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:00,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:26:00,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2022-07-23 05:26:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465575683] [2022-07-23 05:26:00,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:00,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-23 05:26:00,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:00,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-23 05:26:00,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2022-07-23 05:26:00,307 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-23 05:26:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:01,664 INFO L93 Difference]: Finished difference Result 315 states and 338 transitions. [2022-07-23 05:26:01,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 05:26:01,664 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-23 05:26:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:01,665 INFO L225 Difference]: With dead ends: 315 [2022-07-23 05:26:01,665 INFO L226 Difference]: Without dead ends: 315 [2022-07-23 05:26:01,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=419, Invalid=2887, Unknown=0, NotChecked=0, Total=3306 [2022-07-23 05:26:01,667 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 457 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:01,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2102 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1241 Invalid, 0 Unknown, 605 Unchecked, 0.6s Time] [2022-07-23 05:26:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-23 05:26:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 201. [2022-07-23 05:26:01,669 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-23 05:26:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2022-07-23 05:26:01,670 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 42 [2022-07-23 05:26:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:01,670 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2022-07-23 05:26:01,670 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-23 05:26:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2022-07-23 05:26:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:26:01,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:01,671 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-23 05:26:01,690 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-23 05:26:01,888 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-23 05:26:01,889 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-23 05:26:01,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:01,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995560, now seen corresponding path program 1 times [2022-07-23 05:26:01,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:01,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340011543] [2022-07-23 05:26:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:01,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:02,032 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-23 05:26:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340011543] [2022-07-23 05:26:02,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340011543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:26:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513068148] [2022-07-23 05:26:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:02,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:26:02,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:26:02,034 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-23 05:26:02,035 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-23 05:26:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:02,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-23 05:26:02,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:02,124 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-23 05:26:02,189 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 05:26:02,189 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-23 05:26:02,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-23 05:26:02,302 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:02,303 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-23 05:26:02,324 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:02,324 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-23 05:26:02,477 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-23 05:26:02,521 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-23 05:26:02,524 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-23 05:26:02,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:02,606 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-23 05:26:02,616 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-23 05:26:02,622 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-23 05:26:02,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:02,632 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-23 05:26:02,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:02,640 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-23 05:26:02,643 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-23 05:26:02,656 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:02,657 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-23 05:26:02,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:02,669 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-23 05:26:02,743 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-23 05:26:02,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513068148] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:02,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:26:02,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-07-23 05:26:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452315723] [2022-07-23 05:26:02,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:02,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 05:26:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:02,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 05:26:02,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=539, Unknown=3, NotChecked=150, Total=812 [2022-07-23 05:26:02,746 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-23 05:26:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:03,220 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2022-07-23 05:26:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:26:03,221 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-23 05:26:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:03,221 INFO L225 Difference]: With dead ends: 248 [2022-07-23 05:26:03,221 INFO L226 Difference]: Without dead ends: 248 [2022-07-23 05:26:03,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=753, Unknown=3, NotChecked=180, Total=1122 [2022-07-23 05:26:03,222 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:03,222 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.3s Time] [2022-07-23 05:26:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-23 05:26:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2022-07-23 05:26:03,225 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-23 05:26:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2022-07-23 05:26:03,225 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 44 [2022-07-23 05:26:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:03,226 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2022-07-23 05:26:03,226 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-23 05:26:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2022-07-23 05:26:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:26:03,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:03,227 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-23 05:26:03,244 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-23 05:26:03,444 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-23 05:26:03,445 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-23 05:26:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:03,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995559, now seen corresponding path program 1 times [2022-07-23 05:26:03,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:03,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157180697] [2022-07-23 05:26:03,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:03,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:03,590 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-23 05:26:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157180697] [2022-07-23 05:26:03,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157180697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:26:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610134323] [2022-07-23 05:26:03,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:26:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:26:03,592 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-23 05:26:03,592 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-23 05:26:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:03,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-23 05:26:03,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:03,701 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-23 05:26:03,753 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-23 05:26:03,763 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:03,763 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-23 05:26:03,785 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-23 05:26:03,793 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-23 05:26:03,883 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:26:03,884 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-23 05:26:03,887 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-23 05:26:03,899 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:03,899 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-23 05:26:03,935 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:03,935 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-23 05:26:03,939 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-23 05:26:04,139 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-23 05:26:04,143 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-23 05:26:04,184 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-23 05:26:04,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:04,343 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-23 05:26:04,364 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-23 05:26:04,370 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-23 05:26:04,380 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,380 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-23 05:26:04,384 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,384 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-23 05:26:04,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,405 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-23 05:26:04,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,414 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-23 05:26:04,418 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-23 05:26:04,422 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-23 05:26:04,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:04,462 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-23 05:26:04,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:04,465 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-23 05:26:04,545 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-23 05:26:04,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610134323] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:04,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:26:04,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2022-07-23 05:26:04,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492791733] [2022-07-23 05:26:04,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:04,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-23 05:26:04,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:04,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-23 05:26:04,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=618, Unknown=3, NotChecked=156, Total=870 [2022-07-23 05:26:04,547 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-23 05:26:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:05,323 INFO L93 Difference]: Finished difference Result 247 states and 268 transitions. [2022-07-23 05:26:05,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 05:26:05,323 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-23 05:26:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:05,324 INFO L225 Difference]: With dead ends: 247 [2022-07-23 05:26:05,324 INFO L226 Difference]: Without dead ends: 247 [2022-07-23 05:26:05,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=1198, Unknown=3, NotChecked=228, Total=1722 [2022-07-23 05:26:05,325 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 434 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:05,325 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.4s Time] [2022-07-23 05:26:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-23 05:26:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2022-07-23 05:26:05,328 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-23 05:26:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2022-07-23 05:26:05,329 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 44 [2022-07-23 05:26:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:05,329 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2022-07-23 05:26:05,329 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-23 05:26:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2022-07-23 05:26:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:26:05,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:05,330 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-23 05:26:05,350 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-23 05:26:05,547 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-23 05:26:05,548 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-23 05:26:05,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:05,548 INFO L85 PathProgramCache]: Analyzing trace with hash -64101254, now seen corresponding path program 1 times [2022-07-23 05:26:05,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:05,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451615546] [2022-07-23 05:26:05,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:05,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:05,579 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-23 05:26:05,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:05,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451615546] [2022-07-23 05:26:05,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451615546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:05,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:05,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:26:05,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228004824] [2022-07-23 05:26:05,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:05,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:26:05,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:05,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:26:05,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:26:05,582 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-23 05:26:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:05,599 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-07-23 05:26:05,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:26:05,600 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-23 05:26:05,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:05,601 INFO L225 Difference]: With dead ends: 298 [2022-07-23 05:26:05,601 INFO L226 Difference]: Without dead ends: 298 [2022-07-23 05:26:05,601 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-23 05:26:05,602 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-23 05:26:05,602 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-23 05:26:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-23 05:26:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2022-07-23 05:26:05,605 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-23 05:26:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-07-23 05:26:05,606 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 44 [2022-07-23 05:26:05,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:05,606 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-07-23 05:26:05,607 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-23 05:26:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-07-23 05:26:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 05:26:05,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:05,607 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-23 05:26:05,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 05:26:05,608 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-23 05:26:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2014223229, now seen corresponding path program 1 times [2022-07-23 05:26:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:05,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838925599] [2022-07-23 05:26:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:05,657 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-23 05:26:05,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:05,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838925599] [2022-07-23 05:26:05,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838925599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:26:05,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552456511] [2022-07-23 05:26:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:05,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:26:05,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:26:05,659 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-23 05:26:05,661 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-23 05:26:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:05,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 05:26:05,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:05,778 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-23 05:26:05,780 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-23 05:26:05,791 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-23 05:26:05,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:05,832 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-23 05:26:05,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552456511] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:05,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:26:05,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-23 05:26:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128604156] [2022-07-23 05:26:05,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:05,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:26:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:26:05,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:26:05,833 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-23 05:26:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:05,919 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2022-07-23 05:26:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:26:05,920 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-23 05:26:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:05,921 INFO L225 Difference]: With dead ends: 283 [2022-07-23 05:26:05,921 INFO L226 Difference]: Without dead ends: 275 [2022-07-23 05:26:05,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:26:05,921 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 192 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-23 05:26:05,922 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-23 05:26:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-23 05:26:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2022-07-23 05:26:05,925 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-23 05:26:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2022-07-23 05:26:05,926 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 45 [2022-07-23 05:26:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:05,926 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2022-07-23 05:26:05,926 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-23 05:26:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2022-07-23 05:26:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 05:26:05,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:05,927 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-23 05:26:05,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 05:26:06,140 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-23 05:26:06,140 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-23 05:26:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 164743237, now seen corresponding path program 1 times [2022-07-23 05:26:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:06,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124677871] [2022-07-23 05:26:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:06,391 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-23 05:26:06,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:06,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124677871] [2022-07-23 05:26:06,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124677871] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:26:06,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413182483] [2022-07-23 05:26:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:06,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:26:06,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:26:06,392 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-23 05:26:06,393 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-23 05:26:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:06,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-23 05:26:06,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:06,485 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-23 05:26:06,533 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:06,533 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-23 05:26:06,567 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-23 05:26:06,678 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:06,678 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-23 05:26:06,696 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:06,696 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-23 05:26:06,744 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:06,744 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-23 05:26:06,776 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:26:06,776 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-23 05:26:06,884 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:26:06,884 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-23 05:26:06,894 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-23 05:26:06,960 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:26:06,961 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-23 05:26:07,037 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-23 05:26:07,039 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-23 05:26:07,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:07,056 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-23 05:26:07,063 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-23 05:26:07,066 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-23 05:26:07,071 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-23 05:26:07,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:07,129 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-23 05:26:07,133 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-23 05:26:07,151 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-23 05:26:07,158 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-23 05:26:07,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:07,169 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-23 05:26:07,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:07,175 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-23 05:26:07,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:07,186 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-23 05:26:07,192 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-23 05:26:07,199 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:26:07,199 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-23 05:26:07,354 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-23 05:26:07,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413182483] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:07,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:26:07,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-07-23 05:26:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938686399] [2022-07-23 05:26:07,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:07,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 05:26:07,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:07,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 05:26:07,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=925, Unknown=7, NotChecked=476, Total=1560 [2022-07-23 05:26:07,356 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-23 05:26:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:08,333 INFO L93 Difference]: Finished difference Result 336 states and 377 transitions. [2022-07-23 05:26:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 05:26:08,334 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-23 05:26:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:08,335 INFO L225 Difference]: With dead ends: 336 [2022-07-23 05:26:08,335 INFO L226 Difference]: Without dead ends: 336 [2022-07-23 05:26:08,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=396, Invalid=1881, Unknown=7, NotChecked=686, Total=2970 [2022-07-23 05:26:08,336 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-23 05:26:08,336 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-23 05:26:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-23 05:26:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 292. [2022-07-23 05:26:08,339 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-23 05:26:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2022-07-23 05:26:08,340 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 45 [2022-07-23 05:26:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:08,340 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2022-07-23 05:26:08,340 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-23 05:26:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2022-07-23 05:26:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 05:26:08,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:08,341 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-23 05:26:08,376 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-23 05:26:08,541 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-23 05:26:08,541 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-23 05:26:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:08,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1983636472, now seen corresponding path program 1 times [2022-07-23 05:26:08,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:08,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267964364] [2022-07-23 05:26:08,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:08,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:08,651 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-23 05:26:08,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:26:08,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267964364] [2022-07-23 05:26:08,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267964364] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:26:08,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495177416] [2022-07-23 05:26:08,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:08,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:26:08,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:26:08,654 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-23 05:26:08,655 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-23 05:26:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:08,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-23 05:26:08,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:08,759 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-23 05:26:08,798 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:08,798 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-23 05:26:08,820 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-23 05:26:08,827 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-23 05:26:08,850 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-23 05:26:08,880 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-23 05:26:08,889 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-23 05:26:08,962 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-23 05:26:08,969 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-23 05:26:08,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:09,001 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-23 05:26:09,007 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-23 05:26:09,010 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-23 05:26:09,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:09,016 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-23 05:26:09,020 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:09,021 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-23 05:26:09,030 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-23 05:26:09,085 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-23 05:26:09,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495177416] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:09,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:26:09,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2022-07-23 05:26:09,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800823839] [2022-07-23 05:26:09,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:09,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 05:26:09,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:26:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 05:26:09,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=385, Unknown=3, NotChecked=126, Total=600 [2022-07-23 05:26:09,088 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-23 05:26:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:09,557 INFO L93 Difference]: Finished difference Result 301 states and 332 transitions. [2022-07-23 05:26:09,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:26:09,558 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-23 05:26:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:09,559 INFO L225 Difference]: With dead ends: 301 [2022-07-23 05:26:09,559 INFO L226 Difference]: Without dead ends: 301 [2022-07-23 05:26:09,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=828, Unknown=3, NotChecked=192, Total=1260 [2022-07-23 05:26:09,560 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 409 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:09,560 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.3s Time] [2022-07-23 05:26:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-23 05:26:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 294. [2022-07-23 05:26:09,563 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-23 05:26:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 330 transitions. [2022-07-23 05:26:09,563 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 330 transitions. Word has length 46 [2022-07-23 05:26:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:09,564 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 330 transitions. [2022-07-23 05:26:09,564 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-23 05:26:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 330 transitions. [2022-07-23 05:26:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-23 05:26:09,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:09,564 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-23 05:26:09,582 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-23 05:26:09,782 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-23 05:26:09,783 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-23 05:26:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:09,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1363188935, now seen corresponding path program 1 times [2022-07-23 05:26:09,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:26:09,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72860858] [2022-07-23 05:26:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:09,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:26:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:09,812 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2022-07-23 05:26:09,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 05:26:09,821 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-23 05:26:09,825 INFO L158 Benchmark]: Toolchain (without parser) took 25672.98ms. Allocated memory was 94.4MB in the beginning and 283.1MB in the end (delta: 188.7MB). Free memory was 55.5MB in the beginning and 212.9MB in the end (delta: -157.4MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2022-07-23 05:26:09,826 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 05:26:09,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.43ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 55.3MB in the beginning and 107.2MB in the end (delta: -51.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-23 05:26:09,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.60ms. Allocated memory is still 132.1MB. Free memory was 107.2MB in the beginning and 104.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 05:26:09,827 INFO L158 Benchmark]: Boogie Preprocessor took 34.90ms. Allocated memory is still 132.1MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 05:26:09,827 INFO L158 Benchmark]: RCFGBuilder took 566.55ms. Allocated memory is still 132.1MB. Free memory was 102.8MB in the beginning and 79.1MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-23 05:26:09,830 INFO L158 Benchmark]: TraceAbstraction took 24570.12ms. Allocated memory was 132.1MB in the beginning and 283.1MB in the end (delta: 151.0MB). Free memory was 78.5MB in the beginning and 212.9MB in the end (delta: -134.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2022-07-23 05:26:09,834 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.18ms. Allocated memory is still 94.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.43ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 55.3MB in the beginning and 107.2MB in the end (delta: -51.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.60ms. Allocated memory is still 132.1MB. Free memory was 107.2MB in the beginning and 104.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.90ms. Allocated memory is still 132.1MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.55ms. Allocated memory is still 132.1MB. Free memory was 102.8MB in the beginning and 79.1MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24570.12ms. Allocated memory was 132.1MB in the beginning and 283.1MB in the end (delta: 151.0MB). Free memory was 78.5MB in the beginning and 212.9MB in the end (delta: -134.5MB). Peak memory consumption was 16.7MB. 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-23 05:26:09,892 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-?-791161d [2022-07-23 05:26:11,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:26:11,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:26:11,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:26:11,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:26:11,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:26:11,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:26:11,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:26:11,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:26:11,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:26:11,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:26:11,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:26:11,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:26:11,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:26:11,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:26:11,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:26:11,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:26:11,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:26:11,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:26:11,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:26:11,681 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:26:11,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:26:11,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:26:11,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:26:11,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:26:11,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:26:11,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:26:11,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:26:11,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:26:11,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:26:11,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:26:11,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:26:11,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:26:11,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:26:11,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:26:11,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:26:11,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:26:11,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:26:11,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:26:11,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:26:11,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:26:11,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:26:11,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-07-23 05:26:11,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:26:11,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:26:11,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:26:11,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:26:11,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:26:11,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:26:11,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:26:11,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:26:11,749 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:26:11,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:26:11,749 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:26:11,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:26:11,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:26:11,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:26:11,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:26:11,750 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:26:11,751 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:26:11,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:26:11,751 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:26:11,751 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 05:26:11,751 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 05:26:11,751 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:26:11,751 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:26:11,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:26:11,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:26:11,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:26:11,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:26:11,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:26:11,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:26:11,753 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 05:26:11,753 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 05:26:11,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 05:26:11,753 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-23 05:26:12,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:26:12,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:26:12,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:26:12,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:26:12,060 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:26:12,061 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-23 05:26:12,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19e3e4f8/cc129aa212ac46f0b73fa285007b24f0/FLAG317ad7ea6 [2022-07-23 05:26:12,513 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:26:12,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-23 05:26:12,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19e3e4f8/cc129aa212ac46f0b73fa285007b24f0/FLAG317ad7ea6 [2022-07-23 05:26:12,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19e3e4f8/cc129aa212ac46f0b73fa285007b24f0 [2022-07-23 05:26:12,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:26:12,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:26:12,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:26:12,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:26:12,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:26:12,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:26:12" (1/1) ... [2022-07-23 05:26:12,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ad12a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:12, skipping insertion in model container [2022-07-23 05:26:12,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:26:12" (1/1) ... [2022-07-23 05:26:12,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:26:12,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:26:13,173 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-23 05:26:13,178 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-23 05:26:13,179 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-23 05:26:13,180 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-23 05:26:13,182 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-23 05:26:13,183 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-23 05:26:13,184 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-23 05:26:13,185 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-23 05:26:13,186 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-23 05:26:13,190 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-23 05:26:13,193 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-23 05:26:13,196 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-23 05:26:13,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[23386,23399] [2022-07-23 05:26:13,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[23532,23545] [2022-07-23 05:26:13,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:26:13,227 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:26:13,259 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-23 05:26:13,267 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-23 05:26:13,271 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-23 05:26:13,272 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-23 05:26:13,275 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-23 05:26:13,277 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-23 05:26:13,278 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-23 05:26:13,281 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-23 05:26:13,283 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-23 05:26:13,283 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-23 05:26:13,285 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-23 05:26:13,286 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-23 05:26:13,289 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-23 05:26:13,291 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-23 05:26:13,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:26:13,322 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:26:13,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13 WrapperNode [2022-07-23 05:26:13,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:26:13,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:26:13,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:26:13,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:26:13,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,387 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-07-23 05:26:13,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:26:13,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:26:13,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:26:13,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:26:13,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:26:13,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:26:13,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:26:13,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:26:13,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (1/1) ... [2022-07-23 05:26:13,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:26:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:26:13,474 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-23 05:26:13,482 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-23 05:26:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 05:26:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 05:26:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 05:26:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:26:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:26:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:26:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 05:26:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 05:26:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:26:13,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:26:13,641 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:26:13,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:26:14,104 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:26:14,110 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:26:14,110 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-23 05:26:14,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:26:14 BoogieIcfgContainer [2022-07-23 05:26:14,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:26:14,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:26:14,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:26:14,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:26:14,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:26:12" (1/3) ... [2022-07-23 05:26:14,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5ca8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:26:14, skipping insertion in model container [2022-07-23 05:26:14,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:26:13" (2/3) ... [2022-07-23 05:26:14,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5ca8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:26:14, skipping insertion in model container [2022-07-23 05:26:14,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:26:14" (3/3) ... [2022-07-23 05:26:14,118 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2022-07-23 05:26:14,128 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:26:14,128 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-07-23 05:26:14,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:26:14,181 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@2f5e6d01, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32a96bf3 [2022-07-23 05:26:14,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-07-23 05:26:14,190 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-23 05:26:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:26:14,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:14,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:26:14,196 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-23 05:26:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 05:26:14,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:14,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838109358] [2022-07-23 05:26:14,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:14,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:14,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:14,209 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-23 05:26:14,210 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-23 05:26:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:14,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 05:26:14,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:14,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-23 05:26:14,307 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-23 05:26:14,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:14,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:14,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838109358] [2022-07-23 05:26:14,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838109358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:14,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:14,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:26:14,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380977034] [2022-07-23 05:26:14,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:14,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:26:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:14,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:26:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:26:14,344 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-23 05:26:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:14,583 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2022-07-23 05:26:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:26:14,585 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-23 05:26:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:14,592 INFO L225 Difference]: With dead ends: 166 [2022-07-23 05:26:14,593 INFO L226 Difference]: Without dead ends: 162 [2022-07-23 05:26:14,594 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-23 05:26:14,604 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-23 05:26:14,605 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-23 05:26:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-23 05:26:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-07-23 05:26:14,641 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-23 05:26:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2022-07-23 05:26:14,644 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 3 [2022-07-23 05:26:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:14,644 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2022-07-23 05:26:14,644 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-23 05:26:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-07-23 05:26:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 05:26:14,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:14,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 05:26:14,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 05:26:14,848 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-23 05:26:14,848 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-23 05:26:14,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:14,849 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 05:26:14,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:14,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639195724] [2022-07-23 05:26:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:14,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:14,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:14,851 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-23 05:26:14,852 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-23 05:26:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:14,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 05:26:14,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:14,909 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-23 05:26:14,916 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-23 05:26:14,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:14,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:14,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639195724] [2022-07-23 05:26:14,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639195724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:14,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:14,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:26:14,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720945824] [2022-07-23 05:26:14,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:14,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:26:14,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:14,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:26:14,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:26:14,922 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-23 05:26:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:15,120 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2022-07-23 05:26:15,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:26:15,122 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-23 05:26:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:15,123 INFO L225 Difference]: With dead ends: 152 [2022-07-23 05:26:15,123 INFO L226 Difference]: Without dead ends: 152 [2022-07-23 05:26:15,123 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-23 05:26:15,124 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 05:26:15,124 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-23 05:26:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-23 05:26:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-07-23 05:26:15,136 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-23 05:26:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-07-23 05:26:15,142 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 3 [2022-07-23 05:26:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:15,142 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-07-23 05:26:15,142 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-23 05:26:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-07-23 05:26:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:26:15,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:15,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:26:15,151 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-23 05:26:15,349 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-23 05:26:15,349 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-23 05:26:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:15,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2022-07-23 05:26:15,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:15,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101144462] [2022-07-23 05:26:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:15,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:15,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:15,354 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-23 05:26:15,356 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-23 05:26:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:15,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 05:26:15,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:15,416 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-23 05:26:15,444 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 05:26:15,445 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-23 05:26:15,455 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-23 05:26:15,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:15,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:15,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101144462] [2022-07-23 05:26:15,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101144462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:15,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:15,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:26:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378682942] [2022-07-23 05:26:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:15,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:26:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:26:15,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:26:15,458 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-23 05:26:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:15,626 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2022-07-23 05:26:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:26:15,626 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-23 05:26:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:15,627 INFO L225 Difference]: With dead ends: 158 [2022-07-23 05:26:15,627 INFO L226 Difference]: Without dead ends: 158 [2022-07-23 05:26:15,627 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-23 05:26:15,628 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 256 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 05:26:15,628 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-23 05:26:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-23 05:26:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2022-07-23 05:26:15,633 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-23 05:26:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2022-07-23 05:26:15,634 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 7 [2022-07-23 05:26:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:15,634 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2022-07-23 05:26:15,635 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-23 05:26:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2022-07-23 05:26:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:26:15,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:15,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:26:15,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 05:26:15,841 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-23 05:26:15,841 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-23 05:26:15,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2022-07-23 05:26:15,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:15,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981883513] [2022-07-23 05:26:15,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:15,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:15,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:15,844 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-23 05:26:15,845 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-23 05:26:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:15,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 05:26:15,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:15,901 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-23 05:26:15,967 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:15,967 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-23 05:26:15,984 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-23 05:26:15,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:15,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:15,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981883513] [2022-07-23 05:26:15,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981883513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:15,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:15,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:26:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280817642] [2022-07-23 05:26:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:15,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:26:15,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:15,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:26:15,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:26:15,987 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-23 05:26:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:16,244 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2022-07-23 05:26:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:26:16,245 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-23 05:26:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:16,246 INFO L225 Difference]: With dead ends: 240 [2022-07-23 05:26:16,246 INFO L226 Difference]: Without dead ends: 240 [2022-07-23 05:26:16,246 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-23 05:26:16,247 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:16,247 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.2s Time] [2022-07-23 05:26:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-23 05:26:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 154. [2022-07-23 05:26:16,252 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-23 05:26:16,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2022-07-23 05:26:16,252 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 7 [2022-07-23 05:26:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:16,253 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2022-07-23 05:26:16,253 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-23 05:26:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2022-07-23 05:26:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 05:26:16,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:16,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:26:16,279 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-23 05:26:16,453 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-23 05:26:16,454 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-23 05:26:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash 59268142, now seen corresponding path program 1 times [2022-07-23 05:26:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:16,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813749599] [2022-07-23 05:26:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:16,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:16,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:16,456 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-23 05:26:16,457 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-23 05:26:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:16,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 05:26:16,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:16,508 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-23 05:26:16,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:16,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:16,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813749599] [2022-07-23 05:26:16,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813749599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:16,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:16,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:26:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109517005] [2022-07-23 05:26:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:16,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:26:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:16,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:26:16,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:26:16,511 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-23 05:26:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:16,548 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2022-07-23 05:26:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:26:16,549 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-23 05:26:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:16,549 INFO L225 Difference]: With dead ends: 144 [2022-07-23 05:26:16,550 INFO L226 Difference]: Without dead ends: 144 [2022-07-23 05:26:16,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-23 05:26:16,551 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 122 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.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, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:16,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 131 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:26:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-23 05:26:16,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-07-23 05:26:16,554 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-23 05:26:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2022-07-23 05:26:16,555 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 8 [2022-07-23 05:26:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:16,555 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2022-07-23 05:26:16,555 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-23 05:26:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2022-07-23 05:26:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:26:16,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:16,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:26:16,571 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-23 05:26:16,762 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-23 05:26:16,762 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-23 05:26:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:16,763 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-07-23 05:26:16,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:16,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543170146] [2022-07-23 05:26:16,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:16,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:16,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:16,765 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-23 05:26:16,766 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-23 05:26:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:16,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 05:26:16,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:16,843 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-23 05:26:16,854 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-23 05:26:16,867 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-23 05:26:16,880 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-23 05:26:16,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:16,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:16,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543170146] [2022-07-23 05:26:16,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543170146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:16,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:16,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:26:16,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899012576] [2022-07-23 05:26:16,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:16,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:26:16,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:16,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:26:16,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:26:16,883 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-23 05:26:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:17,212 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2022-07-23 05:26:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:26:17,214 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-23 05:26:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:17,214 INFO L225 Difference]: With dead ends: 215 [2022-07-23 05:26:17,214 INFO L226 Difference]: Without dead ends: 215 [2022-07-23 05:26:17,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-23 05:26:17,215 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 109 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:17,215 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.3s Time] [2022-07-23 05:26:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-07-23 05:26:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2022-07-23 05:26:17,218 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-23 05:26:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2022-07-23 05:26:17,219 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 11 [2022-07-23 05:26:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:17,219 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2022-07-23 05:26:17,219 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-23 05:26:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2022-07-23 05:26:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:26:17,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:17,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:26:17,232 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-23 05:26:17,423 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-23 05:26:17,423 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-23 05:26:17,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-07-23 05:26:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:17,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641586857] [2022-07-23 05:26:17,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:17,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:17,425 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-23 05:26:17,427 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-23 05:26:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:17,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 05:26:17,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:17,497 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-23 05:26:17,512 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-23 05:26:17,516 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-23 05:26:17,539 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-23 05:26:17,542 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-23 05:26:17,565 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-23 05:26:17,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:17,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:17,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641586857] [2022-07-23 05:26:17,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641586857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:17,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:17,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:26:17,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816026541] [2022-07-23 05:26:17,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:17,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:26:17,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:17,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:26:17,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:26:17,567 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-23 05:26:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:17,991 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2022-07-23 05:26:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:26:17,992 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-23 05:26:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:17,992 INFO L225 Difference]: With dead ends: 207 [2022-07-23 05:26:17,993 INFO L226 Difference]: Without dead ends: 207 [2022-07-23 05:26:17,993 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-23 05:26:17,993 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:17,993 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.3s Time] [2022-07-23 05:26:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-23 05:26:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2022-07-23 05:26:17,996 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-23 05:26:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-07-23 05:26:17,996 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2022-07-23 05:26:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:17,996 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-07-23 05:26:17,997 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-23 05:26:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-07-23 05:26:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:26:17,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:17,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:26:18,005 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-23 05:26:18,203 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-23 05:26:18,204 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-23 05:26:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:18,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1469737219, now seen corresponding path program 1 times [2022-07-23 05:26:18,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:18,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993305084] [2022-07-23 05:26:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:18,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:18,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:18,205 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-23 05:26:18,210 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-23 05:26:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:18,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 05:26:18,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:18,257 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-23 05:26:18,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:18,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:18,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993305084] [2022-07-23 05:26:18,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993305084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:18,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:18,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:26:18,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438794233] [2022-07-23 05:26:18,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:18,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:26:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:18,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:26:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:26:18,260 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-23 05:26:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:18,275 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-07-23 05:26:18,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:26:18,275 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-23 05:26:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:18,276 INFO L225 Difference]: With dead ends: 185 [2022-07-23 05:26:18,276 INFO L226 Difference]: Without dead ends: 185 [2022-07-23 05:26:18,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-23 05:26:18,277 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-23 05:26:18,277 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-23 05:26:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-23 05:26:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2022-07-23 05:26:18,279 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-23 05:26:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2022-07-23 05:26:18,280 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 14 [2022-07-23 05:26:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:18,280 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2022-07-23 05:26:18,280 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-23 05:26:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2022-07-23 05:26:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:26:18,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:18,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:26:18,290 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-23 05:26:18,489 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-23 05:26:18,490 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-23 05:26:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash -529144660, now seen corresponding path program 1 times [2022-07-23 05:26:18,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:18,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356812143] [2022-07-23 05:26:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:18,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:18,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:18,496 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-23 05:26:18,497 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-23 05:26:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:18,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 05:26:18,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:18,564 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-23 05:26:18,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:18,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356812143] [2022-07-23 05:26:18,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356812143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:18,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:18,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:26:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416972273] [2022-07-23 05:26:18,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:18,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:26:18,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:18,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:26:18,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:26:18,566 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-23 05:26:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:18,597 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-07-23 05:26:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:26:18,598 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-23 05:26:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:18,599 INFO L225 Difference]: With dead ends: 176 [2022-07-23 05:26:18,599 INFO L226 Difference]: Without dead ends: 176 [2022-07-23 05:26:18,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-23 05:26:18,600 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-23 05:26:18,600 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-23 05:26:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-23 05:26:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2022-07-23 05:26:18,602 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-23 05:26:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2022-07-23 05:26:18,603 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 17 [2022-07-23 05:26:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:18,603 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2022-07-23 05:26:18,603 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-23 05:26:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2022-07-23 05:26:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:26:18,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:18,604 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-23 05:26:18,614 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-23 05:26:18,810 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-23 05:26:18,811 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-23 05:26:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:18,811 INFO L85 PathProgramCache]: Analyzing trace with hash 271532674, now seen corresponding path program 1 times [2022-07-23 05:26:18,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:18,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352309590] [2022-07-23 05:26:18,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:18,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:18,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:18,813 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-23 05:26:18,813 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-23 05:26:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:18,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 05:26:18,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:18,898 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-23 05:26:18,910 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-23 05:26:18,927 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-23 05:26:18,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:18,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:18,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352309590] [2022-07-23 05:26:18,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352309590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:18,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:18,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:26:18,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285301642] [2022-07-23 05:26:18,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:18,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:26:18,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:18,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:26:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:26:18,929 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-23 05:26:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:19,101 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2022-07-23 05:26:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:26:19,102 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-23 05:26:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:19,103 INFO L225 Difference]: With dead ends: 152 [2022-07-23 05:26:19,103 INFO L226 Difference]: Without dead ends: 152 [2022-07-23 05:26:19,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 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-23 05:26:19,103 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-23 05:26:19,104 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-23 05:26:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-23 05:26:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-23 05:26:19,105 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-23 05:26:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-07-23 05:26:19,106 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 18 [2022-07-23 05:26:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:19,106 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-07-23 05:26:19,106 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-23 05:26:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-07-23 05:26:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:26:19,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:19,107 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-23 05:26:19,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-23 05:26:19,323 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-23 05:26:19,323 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-23 05:26:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1721073736, now seen corresponding path program 1 times [2022-07-23 05:26:19,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:19,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615135192] [2022-07-23 05:26:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:19,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:19,326 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-23 05:26:19,327 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-23 05:26:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:19,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 05:26:19,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:19,470 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-23 05:26:19,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:19,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:19,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615135192] [2022-07-23 05:26:19,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615135192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:19,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:19,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:26:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645382164] [2022-07-23 05:26:19,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:19,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:26:19,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:19,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:26:19,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:26:19,473 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-23 05:26:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:19,610 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2022-07-23 05:26:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:26:19,611 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-23 05:26:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:19,611 INFO L225 Difference]: With dead ends: 156 [2022-07-23 05:26:19,611 INFO L226 Difference]: Without dead ends: 156 [2022-07-23 05:26:19,612 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-23 05:26:19,612 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:19,612 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.1s Time] [2022-07-23 05:26:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-23 05:26:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2022-07-23 05:26:19,614 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-23 05:26:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-07-23 05:26:19,615 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 19 [2022-07-23 05:26:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:19,615 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-07-23 05:26:19,615 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-23 05:26:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-07-23 05:26:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:26:19,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:19,615 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-23 05:26:19,622 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-23 05:26:19,822 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-23 05:26:19,822 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-23 05:26:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1701915074, now seen corresponding path program 1 times [2022-07-23 05:26:19,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:19,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080123421] [2022-07-23 05:26:19,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:19,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:19,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:19,824 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-23 05:26:19,825 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-23 05:26:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:19,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 05:26:19,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:19,893 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-23 05:26:19,899 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-23 05:26:19,921 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-23 05:26:19,922 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-23 05:26:19,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:19,936 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-23 05:26:19,967 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-23 05:26:19,970 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-23 05:26:19,988 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-23 05:26:19,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:19,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:19,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080123421] [2022-07-23 05:26:19,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080123421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:19,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:19,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:26:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684183165] [2022-07-23 05:26:19,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:19,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:26:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:19,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:26:19,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:26:19,990 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-23 05:26:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:20,148 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-07-23 05:26:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:26:20,149 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-23 05:26:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:20,149 INFO L225 Difference]: With dead ends: 149 [2022-07-23 05:26:20,150 INFO L226 Difference]: Without dead ends: 149 [2022-07-23 05:26:20,150 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-23 05:26:20,150 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:20,150 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.1s Time] [2022-07-23 05:26:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-07-23 05:26:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2022-07-23 05:26:20,152 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-23 05:26:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2022-07-23 05:26:20,153 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 19 [2022-07-23 05:26:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:20,153 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2022-07-23 05:26:20,153 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-23 05:26:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2022-07-23 05:26:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 05:26:20,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:20,154 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-23 05:26:20,160 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-23 05:26:20,360 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-23 05:26:20,360 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-23 05:26:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash 812348068, now seen corresponding path program 1 times [2022-07-23 05:26:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:20,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489334544] [2022-07-23 05:26:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:20,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:20,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:20,362 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-23 05:26:20,362 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-23 05:26:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:20,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 05:26:20,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:20,435 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-23 05:26:20,439 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-23 05:26:20,457 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-23 05:26:20,458 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-23 05:26:20,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:20,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 21 treesize of output 20 [2022-07-23 05:26:20,506 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-23 05:26:20,509 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-23 05:26:20,534 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-23 05:26:20,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:20,602 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-23 05:26:20,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:20,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489334544] [2022-07-23 05:26:20,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489334544] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:20,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:20,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-07-23 05:26:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136151557] [2022-07-23 05:26:20,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:20,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:26:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:26:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:26:20,604 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-23 05:26:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:20,715 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-23 05:26:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:26:20,715 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-23 05:26:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:20,716 INFO L225 Difference]: With dead ends: 153 [2022-07-23 05:26:20,716 INFO L226 Difference]: Without dead ends: 153 [2022-07-23 05:26:20,716 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-23 05:26:20,717 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-23 05:26:20,717 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-23 05:26:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-23 05:26:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-23 05:26:20,719 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-23 05:26:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-23 05:26:20,719 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 22 [2022-07-23 05:26:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:20,719 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-23 05:26:20,719 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-23 05:26:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-23 05:26:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 05:26:20,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:20,720 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-23 05:26:20,729 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-23 05:26:20,926 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-23 05:26:20,927 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-23 05:26:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:20,927 INFO L85 PathProgramCache]: Analyzing trace with hash -587014801, now seen corresponding path program 1 times [2022-07-23 05:26:20,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:20,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864456947] [2022-07-23 05:26:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:20,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:20,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:20,929 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-23 05:26:20,930 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-23 05:26:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:21,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 05:26:21,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:21,132 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-23 05:26:21,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:21,181 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-23 05:26:21,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:21,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864456947] [2022-07-23 05:26:21,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864456947] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:21,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:21,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-23 05:26:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837147113] [2022-07-23 05:26:21,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:21,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:26:21,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:21,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:26:21,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:26:21,183 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-23 05:26:21,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:21,430 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2022-07-23 05:26:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:26:21,430 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-23 05:26:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:21,431 INFO L225 Difference]: With dead ends: 155 [2022-07-23 05:26:21,431 INFO L226 Difference]: Without dead ends: 138 [2022-07-23 05:26:21,431 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-23 05:26:21,431 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-23 05:26:21,432 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-23 05:26:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-23 05:26:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-07-23 05:26:21,433 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-23 05:26:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2022-07-23 05:26:21,434 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 23 [2022-07-23 05:26:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:21,434 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2022-07-23 05:26:21,434 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-23 05:26:21,434 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2022-07-23 05:26:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 05:26:21,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:21,434 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-23 05:26:21,441 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-23 05:26:21,641 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-23 05:26:21,641 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-23 05:26:21,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1469175391, now seen corresponding path program 1 times [2022-07-23 05:26:21,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:21,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871347843] [2022-07-23 05:26:21,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:21,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:21,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:21,644 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-23 05:26:21,644 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-23 05:26:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:21,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 05:26:21,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:21,726 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-23 05:26:21,756 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:21,757 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-23 05:26:21,783 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-23 05:26:21,846 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:21,846 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-23 05:26:21,878 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:21,878 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-23 05:26:21,927 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-23 05:26:21,941 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-23 05:26:21,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:21,971 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-23 05:26:22,013 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-23 05:26:22,019 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-23 05:26:22,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:22,027 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-23 05:26:22,036 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:22,036 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-23 05:26:22,040 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-23 05:26:22,154 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-23 05:26:22,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:22,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871347843] [2022-07-23 05:26:22,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871347843] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:22,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:22,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-23 05:26:22,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941250189] [2022-07-23 05:26:22,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:22,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 05:26:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:22,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 05:26:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2022-07-23 05:26:22,156 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-23 05:26:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:22,847 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2022-07-23 05:26:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:26:22,848 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-23 05:26:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:22,849 INFO L225 Difference]: With dead ends: 238 [2022-07-23 05:26:22,849 INFO L226 Difference]: Without dead ends: 238 [2022-07-23 05:26:22,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=282, Unknown=3, NotChecked=114, Total=506 [2022-07-23 05:26:22,849 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 392 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:22,849 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.5s Time] [2022-07-23 05:26:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-23 05:26:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2022-07-23 05:26:22,852 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-23 05:26:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-07-23 05:26:22,852 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 27 [2022-07-23 05:26:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:22,852 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-07-23 05:26:22,852 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-23 05:26:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-07-23 05:26:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 05:26:22,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:22,853 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-23 05:26:22,860 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-23 05:26:23,060 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-23 05:26:23,061 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-23 05:26:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash -442882051, now seen corresponding path program 1 times [2022-07-23 05:26:23,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:23,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154004350] [2022-07-23 05:26:23,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:23,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:23,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:23,063 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-23 05:26:23,064 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-23 05:26:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:23,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 05:26:23,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:23,143 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-23 05:26:23,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:23,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:23,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154004350] [2022-07-23 05:26:23,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154004350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:23,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:23,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:26:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924989451] [2022-07-23 05:26:23,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:23,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:26:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:23,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:26:23,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:26:23,145 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-23 05:26:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:23,165 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2022-07-23 05:26:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:26:23,166 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-23 05:26:23,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:23,166 INFO L225 Difference]: With dead ends: 209 [2022-07-23 05:26:23,166 INFO L226 Difference]: Without dead ends: 209 [2022-07-23 05:26:23,167 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-23 05:26:23,167 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-23 05:26:23,167 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-23 05:26:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-23 05:26:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 169. [2022-07-23 05:26:23,170 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-23 05:26:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2022-07-23 05:26:23,170 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 28 [2022-07-23 05:26:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:23,170 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2022-07-23 05:26:23,170 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-23 05:26:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2022-07-23 05:26:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 05:26:23,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:23,171 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-23 05:26:23,178 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-23 05:26:23,378 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-23 05:26:23,378 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-23 05:26:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:23,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549191, now seen corresponding path program 1 times [2022-07-23 05:26:23,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:23,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550229286] [2022-07-23 05:26:23,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:23,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:23,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:23,380 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-23 05:26:23,382 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-23 05:26:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:23,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 05:26:23,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:23,479 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-23 05:26:23,512 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:26:23,512 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-23 05:26:23,549 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-23 05:26:23,636 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:23,637 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-23 05:26:23,661 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:23,662 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-23 05:26:23,749 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-23 05:26:23,807 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-23 05:26:23,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:23,863 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-23 05:26:23,874 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-23 05:26:23,880 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-23 05:26:23,888 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:23,888 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-23 05:26:23,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:23,896 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-23 05:26:23,900 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-23 05:26:39,853 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-23 05:26:39,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:39,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550229286] [2022-07-23 05:26:39,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550229286] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:39,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:39,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-23 05:26:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64837911] [2022-07-23 05:26:39,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:39,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 05:26:39,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:39,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 05:26:39,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=206, Unknown=5, NotChecked=96, Total=380 [2022-07-23 05:26:39,855 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-23 05:26:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:40,335 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2022-07-23 05:26:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:26:40,336 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-23 05:26:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:40,336 INFO L225 Difference]: With dead ends: 216 [2022-07-23 05:26:40,336 INFO L226 Difference]: Without dead ends: 216 [2022-07-23 05:26:40,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=118, Invalid=309, Unknown=5, NotChecked=120, Total=552 [2022-07-23 05:26:40,337 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-23 05:26:40,337 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-23 05:26:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-23 05:26:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2022-07-23 05:26:40,339 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-23 05:26:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2022-07-23 05:26:40,340 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 35 [2022-07-23 05:26:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:40,340 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2022-07-23 05:26:40,340 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-23 05:26:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2022-07-23 05:26:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 05:26:40,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:40,341 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-23 05:26:40,351 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-23 05:26:40,549 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-23 05:26:40,550 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-23 05:26:40,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:40,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549192, now seen corresponding path program 1 times [2022-07-23 05:26:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:40,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604816885] [2022-07-23 05:26:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:40,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:40,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:40,552 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-23 05:26:40,553 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-23 05:26:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:40,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 05:26:40,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:40,659 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-23 05:26:40,686 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:40,686 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-23 05:26:40,694 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-23 05:26:40,713 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-23 05:26:40,718 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-23 05:26:40,812 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:40,813 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-23 05:26:40,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:40,822 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-23 05:26:40,843 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:40,843 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-23 05:26:40,846 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-23 05:26:40,944 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-23 05:26:40,947 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-23 05:26:40,987 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-23 05:26:40,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:41,270 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-23 05:26:41,309 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-23 05:26:41,332 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-23 05:26:41,351 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:41,351 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-23 05:26:41,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:41,362 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-23 05:26:41,367 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-23 05:26:41,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:41,392 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-23 05:26:41,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:41,401 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-23 05:26:41,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:41,407 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-23 05:26:41,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:26:41,414 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-23 05:26:41,526 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-23 05:26:41,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:41,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604816885] [2022-07-23 05:26:41,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604816885] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:41,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:41,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-23 05:26:41,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704464324] [2022-07-23 05:26:41,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:41,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 05:26:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:41,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 05:26:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-23 05:26:41,528 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-23 05:26:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:43,325 INFO L93 Difference]: Finished difference Result 303 states and 324 transitions. [2022-07-23 05:26:43,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:26:43,326 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-23 05:26:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:43,327 INFO L225 Difference]: With dead ends: 303 [2022-07-23 05:26:43,327 INFO L226 Difference]: Without dead ends: 303 [2022-07-23 05:26:43,328 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-23 05:26:43,328 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-23 05:26:43,328 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-23 05:26:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-23 05:26:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 183. [2022-07-23 05:26:43,331 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-23 05:26:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2022-07-23 05:26:43,331 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 35 [2022-07-23 05:26:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:43,332 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2022-07-23 05:26:43,332 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-23 05:26:43,332 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2022-07-23 05:26:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 05:26:43,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:43,332 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-23 05:26:43,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-23 05:26:43,539 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-23 05:26:43,540 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-23 05:26:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065939, now seen corresponding path program 1 times [2022-07-23 05:26:43,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:43,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988124882] [2022-07-23 05:26:43,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:43,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:43,542 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-23 05:26:43,547 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-23 05:26:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:43,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 05:26:43,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:43,645 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-23 05:26:43,676 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:43,677 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-23 05:26:43,700 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-23 05:26:43,706 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-23 05:26:43,797 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:43,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, 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-23 05:26:43,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:43,806 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-23 05:26:43,831 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:43,832 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-23 05:26:43,835 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-23 05:26:43,839 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-23 05:26:43,977 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-23 05:26:43,980 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-23 05:26:44,031 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-23 05:26:44,060 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-23 05:26:44,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:44,210 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-23 05:26:44,218 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-23 05:26:44,238 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-23 05:26:44,247 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-23 05:26:44,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:44,261 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-23 05:26:44,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:44,269 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-23 05:26:44,274 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-23 05:26:44,291 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 05:26:44,291 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-23 05:26:44,385 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-23 05:26:44,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:44,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988124882] [2022-07-23 05:26:44,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988124882] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:44,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:44,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-23 05:26:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794114618] [2022-07-23 05:26:44,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:44,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 05:26:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:44,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 05:26:44,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2022-07-23 05:26:44,388 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-23 05:26:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:45,884 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2022-07-23 05:26:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 05:26:45,884 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-23 05:26:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:45,885 INFO L225 Difference]: With dead ends: 301 [2022-07-23 05:26:45,885 INFO L226 Difference]: Without dead ends: 301 [2022-07-23 05:26:45,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=995, Unknown=3, NotChecked=204, Total=1406 [2022-07-23 05:26:45,886 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-23 05:26:45,886 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-23 05:26:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-23 05:26:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 182. [2022-07-23 05:26:45,889 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-23 05:26:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2022-07-23 05:26:45,889 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 38 [2022-07-23 05:26:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:45,890 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2022-07-23 05:26:45,890 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-23 05:26:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2022-07-23 05:26:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 05:26:45,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:45,891 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-23 05:26:45,898 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-23 05:26:46,098 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-23 05:26:46,098 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-23 05:26:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322345, now seen corresponding path program 1 times [2022-07-23 05:26:46,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:46,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220697143] [2022-07-23 05:26:46,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:46,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:46,100 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-23 05:26:46,101 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-23 05:26:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:46,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-23 05:26:46,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:46,206 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-23 05:26:46,241 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 05:26:46,241 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-23 05:26:46,267 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-23 05:26:46,346 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:46,347 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-23 05:26:46,370 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:46,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-23 05:26:46,491 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-23 05:26:46,547 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-23 05:26:46,551 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-23 05:26:46,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:46,657 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-23 05:26:46,665 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-23 05:26:46,671 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-23 05:26:46,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:46,679 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-23 05:26:46,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:46,688 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-23 05:26:46,691 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-23 05:26:51,060 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-23 05:26:51,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:51,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220697143] [2022-07-23 05:26:51,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220697143] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:51,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:51,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-23 05:26:51,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805609427] [2022-07-23 05:26:51,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:51,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 05:26:51,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:51,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 05:26:51,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=242, Unknown=5, NotChecked=102, Total=420 [2022-07-23 05:26:51,062 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-23 05:26:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:51,520 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-07-23 05:26:51,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:26:51,520 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-23 05:26:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:51,521 INFO L225 Difference]: With dead ends: 218 [2022-07-23 05:26:51,521 INFO L226 Difference]: Without dead ends: 218 [2022-07-23 05:26:51,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=106, Invalid=321, Unknown=5, NotChecked=120, Total=552 [2022-07-23 05:26:51,522 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-23 05:26:51,522 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-23 05:26:51,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-07-23 05:26:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2022-07-23 05:26:51,525 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-23 05:26:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2022-07-23 05:26:51,525 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 40 [2022-07-23 05:26:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:51,525 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2022-07-23 05:26:51,526 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-23 05:26:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2022-07-23 05:26:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-23 05:26:51,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:51,526 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-23 05:26:51,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-23 05:26:51,733 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-23 05:26:51,734 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-23 05:26:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322346, now seen corresponding path program 1 times [2022-07-23 05:26:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:51,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55118361] [2022-07-23 05:26:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:51,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:51,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:51,736 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-23 05:26:51,736 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-23 05:26:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:51,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 05:26:51,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:51,860 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-23 05:26:51,887 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:51,888 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-23 05:26:51,895 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-23 05:26:51,919 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-23 05:26:51,925 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-23 05:26:52,011 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:52,011 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-23 05:26:52,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:26:52,028 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-23 05:26:52,047 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:52,047 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-23 05:26:52,050 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-23 05:26:52,181 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-23 05:26:52,184 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-23 05:26:52,228 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-23 05:26:52,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:52,521 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-23 05:26:52,557 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-23 05:26:52,577 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-23 05:26:52,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:52,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, 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-23 05:26:52,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:52,606 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-23 05:26:52,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:52,621 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-23 05:26:52,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:52,640 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-23 05:26:52,647 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-23 05:26:52,651 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-23 05:26:53,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:53,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2022-07-23 05:26:53,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:53,597 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-23 05:26:53,607 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-23 05:26:53,782 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-23 05:26:53,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:53,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55118361] [2022-07-23 05:26:53,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55118361] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:53,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:53,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-23 05:26:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153968147] [2022-07-23 05:26:53,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:53,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 05:26:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:53,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 05:26:53,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2022-07-23 05:26:53,784 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-23 05:26:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:54,990 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2022-07-23 05:26:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 05:26:54,991 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-23 05:26:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:54,992 INFO L225 Difference]: With dead ends: 217 [2022-07-23 05:26:54,992 INFO L226 Difference]: Without dead ends: 217 [2022-07-23 05:26:54,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=495, Unknown=3, NotChecked=150, Total=812 [2022-07-23 05:26:54,993 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 389 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:26:54,993 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.7s Time] [2022-07-23 05:26:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-23 05:26:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2022-07-23 05:26:54,995 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-23 05:26:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2022-07-23 05:26:54,996 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 40 [2022-07-23 05:26:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:54,996 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2022-07-23 05:26:54,996 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-23 05:26:54,996 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2022-07-23 05:26:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 05:26:54,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:54,997 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-23 05:26:55,013 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-23 05:26:55,203 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-23 05:26:55,204 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-23 05:26:55,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash -466746806, now seen corresponding path program 1 times [2022-07-23 05:26:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:55,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449245404] [2022-07-23 05:26:55,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:55,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:55,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:55,206 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-23 05:26:55,209 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-23 05:26:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:55,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 05:26:55,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:55,336 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-23 05:26:55,338 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-23 05:26:55,370 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-23 05:26:55,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:55,427 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-23 05:26:55,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:55,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449245404] [2022-07-23 05:26:55,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449245404] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:55,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:55,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-23 05:26:55,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008777554] [2022-07-23 05:26:55,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:55,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:26:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:55,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:26:55,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:26:55,429 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-23 05:26:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:55,602 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2022-07-23 05:26:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:26:55,605 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-23 05:26:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:55,605 INFO L225 Difference]: With dead ends: 229 [2022-07-23 05:26:55,605 INFO L226 Difference]: Without dead ends: 229 [2022-07-23 05:26:55,606 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-23 05:26:55,606 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-23 05:26:55,606 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-23 05:26:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-23 05:26:55,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2022-07-23 05:26:55,609 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-23 05:26:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2022-07-23 05:26:55,609 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 41 [2022-07-23 05:26:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:55,609 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2022-07-23 05:26:55,610 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-23 05:26:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2022-07-23 05:26:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 05:26:55,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:55,610 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-23 05:26:55,619 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-23 05:26:55,819 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-23 05:26:55,820 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-23 05:26:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1696634608, now seen corresponding path program 1 times [2022-07-23 05:26:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:55,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434330632] [2022-07-23 05:26:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:55,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:55,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:55,822 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-23 05:26:55,823 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-23 05:26:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:55,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 05:26:55,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:55,922 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-23 05:26:55,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:55,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:55,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434330632] [2022-07-23 05:26:55,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434330632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:55,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:55,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:26:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495500960] [2022-07-23 05:26:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:55,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:26:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:55,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:26:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:26:55,924 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-23 05:26:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:55,946 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2022-07-23 05:26:55,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:26:55,947 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-23 05:26:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:55,947 INFO L225 Difference]: With dead ends: 283 [2022-07-23 05:26:55,948 INFO L226 Difference]: Without dead ends: 283 [2022-07-23 05:26:55,948 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-23 05:26:55,951 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-23 05:26:55,952 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-23 05:26:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-07-23 05:26:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2022-07-23 05:26:55,956 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-23 05:26:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2022-07-23 05:26:55,957 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 41 [2022-07-23 05:26:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:55,957 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2022-07-23 05:26:55,957 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-23 05:26:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2022-07-23 05:26:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 05:26:55,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:55,958 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-23 05:26:55,967 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-23 05:26:56,171 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-23 05:26:56,171 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-23 05:26:56,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1584201975, now seen corresponding path program 1 times [2022-07-23 05:26:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:56,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359067690] [2022-07-23 05:26:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:56,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:56,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:56,174 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-23 05:26:56,175 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-23 05:26:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:56,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 05:26:56,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:56,293 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-23 05:26:56,319 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:56,319 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-23 05:26:56,338 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-23 05:26:56,345 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-23 05:26:56,369 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-23 05:26:56,398 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-23 05:26:56,408 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-23 05:26:56,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 15 treesize of output 7 [2022-07-23 05:26:56,483 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-23 05:26:56,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:56,518 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-23 05:26:56,526 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-23 05:26:56,530 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-23 05:26:56,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:56,538 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-23 05:26:56,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:56,546 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-23 05:26:56,549 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-23 05:26:56,601 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-23 05:26:56,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:56,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359067690] [2022-07-23 05:26:56,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359067690] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:56,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:56,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-23 05:26:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665837897] [2022-07-23 05:26:56,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:56,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 05:26:56,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:56,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 05:26:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=130, Unknown=3, NotChecked=72, Total=240 [2022-07-23 05:26:56,603 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-23 05:26:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:57,386 INFO L93 Difference]: Finished difference Result 258 states and 284 transitions. [2022-07-23 05:26:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:26:57,388 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-23 05:26:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:57,388 INFO L225 Difference]: With dead ends: 258 [2022-07-23 05:26:57,388 INFO L226 Difference]: Without dead ends: 258 [2022-07-23 05:26:57,389 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-23 05:26:57,389 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 168 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-23 05:26:57,389 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-23 05:26:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-23 05:26:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2022-07-23 05:26:57,392 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-23 05:26:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 274 transitions. [2022-07-23 05:26:57,393 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 274 transitions. Word has length 42 [2022-07-23 05:26:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:57,393 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 274 transitions. [2022-07-23 05:26:57,393 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-23 05:26:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2022-07-23 05:26:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 05:26:57,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:57,394 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-23 05:26:57,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-23 05:26:57,601 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-23 05:26:57,601 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-23 05:26:57,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1471647316, now seen corresponding path program 1 times [2022-07-23 05:26:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:57,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119909759] [2022-07-23 05:26:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:57,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:57,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:57,603 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-23 05:26:57,603 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-23 05:26:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:57,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 05:26:57,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:57,711 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-23 05:26:57,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:26:57,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:57,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119909759] [2022-07-23 05:26:57,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119909759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:26:57,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:26:57,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:26:57,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883140557] [2022-07-23 05:26:57,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:26:57,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:26:57,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:57,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:26:57,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:26:57,713 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-23 05:26:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:26:57,737 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2022-07-23 05:26:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:26:57,738 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-23 05:26:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:26:57,738 INFO L225 Difference]: With dead ends: 256 [2022-07-23 05:26:57,738 INFO L226 Difference]: Without dead ends: 256 [2022-07-23 05:26:57,739 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-23 05:26:57,739 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-23 05:26:57,739 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-23 05:26:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-23 05:26:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 237. [2022-07-23 05:26:57,747 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-23 05:26:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 261 transitions. [2022-07-23 05:26:57,748 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 261 transitions. Word has length 42 [2022-07-23 05:26:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:26:57,748 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 261 transitions. [2022-07-23 05:26:57,748 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-23 05:26:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 261 transitions. [2022-07-23 05:26:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 05:26:57,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:26:57,749 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-23 05:26:57,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-23 05:26:57,956 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-23 05:26:57,956 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-23 05:26:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:26:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1095816814, now seen corresponding path program 1 times [2022-07-23 05:26:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:26:57,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687331448] [2022-07-23 05:26:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:26:57,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:26:57,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:26:57,958 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-23 05:26:57,960 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-23 05:26:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:26:58,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 05:26:58,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:26:58,109 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-23 05:26:58,136 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:58,137 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-23 05:26:58,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, 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-23 05:26:58,236 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:58,236 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-23 05:26:58,259 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:26:58,259 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-23 05:26:58,305 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:26:58,305 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-23 05:26:58,337 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:26:58,338 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-23 05:26:58,461 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:26:58,461 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-23 05:26:58,471 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-23 05:26:58,550 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:26:58,550 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-23 05:26:58,632 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-23 05:26:58,648 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-23 05:26:58,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:26:58,682 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-23 05:26:58,692 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-23 05:26:58,699 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-23 05:26:58,708 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-23 05:26:58,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:58,816 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-23 05:26:58,824 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-23 05:26:58,845 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-23 05:26:58,857 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-23 05:26:58,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:58,873 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-23 05:26:58,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:58,884 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-23 05:26:58,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:26:58,894 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-23 05:26:58,900 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-23 05:26:58,917 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:26:58,917 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-23 05:26:59,088 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-23 05:26:59,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:26:59,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687331448] [2022-07-23 05:26:59,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687331448] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:26:59,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:26:59,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-07-23 05:26:59,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102729993] [2022-07-23 05:26:59,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:26:59,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 05:26:59,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:26:59,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 05:26:59,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=275, Unknown=9, NotChecked=280, Total=650 [2022-07-23 05:26:59,089 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-23 05:27:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:00,042 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2022-07-23 05:27:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 05:27:00,043 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-23 05:27:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:00,044 INFO L225 Difference]: With dead ends: 294 [2022-07-23 05:27:00,044 INFO L226 Difference]: Without dead ends: 294 [2022-07-23 05:27:00,045 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=649, Unknown=10, NotChecked=420, Total=1260 [2022-07-23 05:27:00,045 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-23 05:27:00,045 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-23 05:27:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-23 05:27:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 259. [2022-07-23 05:27:00,048 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-23 05:27:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 284 transitions. [2022-07-23 05:27:00,049 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 284 transitions. Word has length 42 [2022-07-23 05:27:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:00,049 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 284 transitions. [2022-07-23 05:27:00,049 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-23 05:27:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 284 transitions. [2022-07-23 05:27:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-23 05:27:00,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:00,050 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-23 05:27:00,058 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-23 05:27:00,258 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-23 05:27:00,258 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-23 05:27:00,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1865620530, now seen corresponding path program 1 times [2022-07-23 05:27:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:27:00,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051299122] [2022-07-23 05:27:00,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:00,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:27:00,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:27:00,260 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-23 05:27:00,260 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-23 05:27:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:00,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 05:27:00,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:00,383 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-23 05:27:00,409 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:27:00,410 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-23 05:27:00,447 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-23 05:27:00,524 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:27:00,524 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-23 05:27:00,546 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:27:00,546 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-23 05:27:00,634 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-23 05:27:00,686 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-23 05:27:00,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:00,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_805 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 05:27:00,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:27:00,866 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-23 05:27:00,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:27:00,888 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-23 05:27:00,892 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-23 05:27:03,001 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-23 05:27:03,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:27:03,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051299122] [2022-07-23 05:27:03,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051299122] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:27:03,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:27:03,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-23 05:27:03,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169922335] [2022-07-23 05:27:03,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:27:03,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 05:27:03,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:27:03,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 05:27:03,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=214, Unknown=14, NotChecked=30, Total=306 [2022-07-23 05:27:03,002 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-23 05:27:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:04,045 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2022-07-23 05:27:04,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:27:04,046 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-23 05:27:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:04,047 INFO L225 Difference]: With dead ends: 266 [2022-07-23 05:27:04,047 INFO L226 Difference]: Without dead ends: 266 [2022-07-23 05:27:04,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=202, Invalid=652, Unknown=20, NotChecked=56, Total=930 [2022-07-23 05:27:04,047 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 289 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:27:04,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 822 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 474 Invalid, 0 Unknown, 316 Unchecked, 0.6s Time] [2022-07-23 05:27:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-23 05:27:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2022-07-23 05:27:04,050 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-23 05:27:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2022-07-23 05:27:04,051 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 43 [2022-07-23 05:27:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:04,051 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2022-07-23 05:27:04,051 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-23 05:27:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2022-07-23 05:27:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:27:04,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:04,052 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-23 05:27:04,075 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-23 05:27:04,259 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-23 05:27:04,259 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-23 05:27:04,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1999661141, now seen corresponding path program 1 times [2022-07-23 05:27:04,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:27:04,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551458933] [2022-07-23 05:27:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:04,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:27:04,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:27:04,262 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-23 05:27:04,263 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-23 05:27:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:04,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 05:27:04,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:04,365 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-23 05:27:04,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 05:27:04,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:27:04,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551458933] [2022-07-23 05:27:04,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551458933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:27:04,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:27:04,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:27:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150060726] [2022-07-23 05:27:04,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:27:04,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:27:04,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:27:04,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:27:04,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:27:04,380 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-23 05:27:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:27:04,560 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2022-07-23 05:27:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:27:04,561 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-23 05:27:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:27:04,562 INFO L225 Difference]: With dead ends: 260 [2022-07-23 05:27:04,562 INFO L226 Difference]: Without dead ends: 260 [2022-07-23 05:27:04,562 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-23 05:27:04,562 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-23 05:27:04,562 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-23 05:27:04,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-23 05:27:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2022-07-23 05:27:04,565 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-23 05:27:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 278 transitions. [2022-07-23 05:27:04,565 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 278 transitions. Word has length 44 [2022-07-23 05:27:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:27:04,566 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 278 transitions. [2022-07-23 05:27:04,566 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-23 05:27:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 278 transitions. [2022-07-23 05:27:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:27:04,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:27:04,566 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-23 05:27:04,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-23 05:27:04,766 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-23 05:27:04,767 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-23 05:27:04,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:27:04,767 INFO L85 PathProgramCache]: Analyzing trace with hash -433899271, now seen corresponding path program 1 times [2022-07-23 05:27:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:27:04,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624794634] [2022-07-23 05:27:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:27:04,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:27:04,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:27:04,769 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-23 05:27:04,771 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-23 05:27:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:27:04,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-23 05:27:04,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:27:04,916 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-23 05:27:04,955 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:27:04,955 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-23 05:27:04,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, 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-23 05:27:05,039 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:27:05,039 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-23 05:27:05,048 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-23 05:27:05,119 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-23 05:27:05,119 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-23 05:27:05,132 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-23 05:27:05,133 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-23 05:27:05,414 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-23 05:27:05,415 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-23 05:27:05,418 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-23 05:27:05,457 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-23 05:27:05,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:27:22,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:27:22,423 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-23 05:27:53,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:27:53,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:27:53,806 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:27:53,807 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 57 [2022-07-23 05:27:55,950 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (= |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 ((.cse89 (forall ((v_arrayElimCell_136 (_ 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) 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| .cse170) (= .cse171 .cse170)))))) (.cse44 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|)))) (.cse91 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse168 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse167 (select (select (store |c_#memory_$Pointer$.base| .cse168 (store (store (select |c_#memory_$Pointer$.base| .cse168) 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| .cse167) (= .cse168 .cse167) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse46 (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 ((.cse166 (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| .cse166 (store (store (select |c_#memory_$Pointer$.base| .cse166) 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|))))) (.cse45 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (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)) (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|)))) (.cse9 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse29 (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse92 (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse164 (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| .cse164 (store (store (select |c_#memory_$Pointer$.base| .cse164) (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|))) (.cse1 (not .cse4)) (.cse35 (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|)) (.cse163 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse161 (select (select (store |c_#memory_$Pointer$.base| .cse162 (store (store (select |c_#memory_$Pointer$.base| .cse162) v_arrayElimCell_136 (_ bv0 32)) .cse163 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| .cse161) (= .cse162 .cse161) (= .cse163 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse36 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse160 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (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)) .cse160 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse160 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (let ((.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 ((.cse158 (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| .cse158 (store (store (select |c_#memory_$Pointer$.base| .cse158) 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|)))))) (.cse67 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse157 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse156 (select (select (store |c_#memory_$Pointer$.base| .cse157 (store (store (select |c_#memory_$Pointer$.base| .cse157) 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| .cse156) (= .cse157 .cse156)))))))) (.cse69 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse154 (select (select (let ((.cse155 (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| .cse155 (store (store (select |c_#memory_$Pointer$.base| .cse155) 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| .cse154) (= .cse154 |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse34 (or .cse4 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse148 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse147 (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| .cse147 (store (store (select |c_#memory_$Pointer$.base| .cse147) v_arrayElimCell_136 (_ bv0 32)) .cse148 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse148 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse35 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse150 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse151 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse149 (select (select (store |c_#memory_$Pointer$.base| .cse150 (store (store (select |c_#memory_$Pointer$.base| .cse150) v_arrayElimCell_136 (_ bv0 32)) .cse151 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| .cse149) (= .cse150 .cse149) (= .cse151 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse153 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse152 (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| .cse152 (store (store (select |c_#memory_$Pointer$.base| .cse152) v_arrayElimCell_136 (_ bv0 32)) .cse153 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse153 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse36))) (.cse108 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse146 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse145 (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| .cse145 (store (store (select |c_#memory_$Pointer$.base| .cse145) v_arrayElimCell_136 (_ bv0 32)) .cse146 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse146 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse21 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32))) (.cse3 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse144 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse144 (select (select (store |c_#memory_$Pointer$.base| .cse144 (store (store (select |c_#memory_$Pointer$.base| .cse144) (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|))))) (.cse61 (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 ((.cse142 (select (select (let ((.cse143 (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| .cse143 (store (store (select |c_#memory_$Pointer$.base| .cse143) 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| .cse142) (= .cse142 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (.cse27 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse141 (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| .cse141 (store (store (select |c_#memory_$Pointer$.base| .cse141) 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|))) (.cse95 (or .cse92 .cse1)) (.cse0 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (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) (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|)))) (.cse81 (and .cse9 .cse29)) (.cse90 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse139 (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| .cse139 (store (store (select |c_#memory_$Pointer$.base| .cse139) (_ 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|)))) (.cse10 (and .cse46 .cse45)) (.cse138 (and .cse89 .cse44 .cse45 .cse91)) (.cse88 (and .cse45 .cse91)) (.cse137 (and .cse44 .cse45))) (let ((.cse5 (or .cse29 .cse137)) (.cse6 (or .cse29 .cse88)) (.cse7 (or .cse29 .cse138)) (.cse8 (or .cse9 .cse138)) (.cse11 (or .cse9 .cse137)) (.cse12 (or .cse9 .cse45)) (.cse13 (or .cse29 .cse45)) (.cse14 (or .cse9 .cse88)) (.cse15 (or .cse29 .cse10)) (.cse16 (or .cse81 .cse90)) (.cse26 (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 ((.cse136 (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| .cse136 (store (store (select |c_#memory_$Pointer$.base| .cse136) 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|)))) (.cse17 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse135 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse134 (select (select (store |c_#memory_$Pointer$.base| .cse135 (store (store (select |c_#memory_$Pointer$.base| .cse135) 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| .cse134) (= .cse135 .cse134))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse18 (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 ((.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) 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|)))))) (.cse84 (or .cse0 .cse1)) (.cse49 (and (or (and .cse61 .cse27) .cse4) .cse95 (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 ((.cse130 (select (select (let ((.cse131 (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| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) 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| .cse130) (= .cse130 |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 ((.cse132 (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| .cse132 (store (store (select |c_#memory_$Pointer$.base| .cse132) 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|)))))) (.cse50 (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse129 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse128 (select (select (store |c_#memory_$Pointer$.base| .cse129 (store (store (select |c_#memory_$Pointer$.base| .cse129) 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| .cse128) (= .cse129 .cse128))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse91 (or .cse89 .cse4))) (.cse94 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse125 (select (select (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|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse125) (= .cse126 .cse125) (= .cse127 (_ bv0 32))))))) (.cse93 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse123 (select (select (let ((.cse124 (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| .cse124 (store (store (select |c_#memory_$Pointer$.base| .cse124) (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 (= .cse123 |c_ULTIMATE.start_main_~item~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse123))))) (.cse68 (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|))) (let ((.cse121 (select (select (store |c_#memory_$Pointer$.base| .cse122 (store (store (select |c_#memory_$Pointer$.base| .cse122) 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| .cse121) (= .cse122 .cse121) (= .cse121 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse57 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse120 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse120 (select (select (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|)))))) (.cse28 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse118 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse119 (select (select (store |c_#memory_$Pointer$.base| .cse118 (store (store (select |c_#memory_$Pointer$.base| .cse118) 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 (= .cse118 .cse119) (= .cse119 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse2 (= (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (.cse33 (and .cse0 .cse3)) (.cse19 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse117 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse117 (select (select (store |c_#memory_$Pointer$.base| .cse117 (store (store (select |c_#memory_$Pointer$.base| .cse117) 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)))) (.cse20 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse116 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse116 (select (select (store |c_#memory_$Pointer$.base| .cse116 (store (store (select |c_#memory_$Pointer$.base| .cse116) 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))))) (.cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse114 (select (select (let ((.cse115 (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| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) 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| .cse114) (= .cse114 |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse51 (and .cse34 .cse108 .cse35 .cse21 .cse36)) (.cse85 (and (or .cse4 .cse69) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse112 (select (select (let ((.cse113 (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| .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 (= |c_ULTIMATE.start_main_~head~0#1.base| .cse112) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse112 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse52 (and .cse58 .cse67))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse1 .cse2) (or .cse4 (and .cse5 .cse6 .cse7 .cse8 (or .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (or .cse9 (and .cse17 .cse18)) (or (and .cse19 .cse20) .cse21) (or .cse9 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse22 (let ((.cse23 (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| .cse23 (store (store (select |c_#memory_$Pointer$.base| .cse23) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) (or .cse9 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| .cse24 (store (store (select |c_#memory_$Pointer$.base| .cse24) 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 (= .cse24 .cse25) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse25 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse26 .cse27 .cse28)) (or .cse29 .cse30) (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 ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| .cse31 (store (store (select |c_#memory_$Pointer$.base| .cse31) 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 (= .cse31 .cse32) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse32))))))) (or .cse33 .cse1 (and .cse9 .cse29 .cse2)) (or .cse29 (and .cse34 .cse35 .cse36)) (or .cse1 (forall ((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|))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse37 (store (store (select |c_#memory_$Pointer$.base| .cse37) (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 (not (= .cse37 .cse38)) (= .cse38 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (or .cse9 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse41 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse39 (select (select (store |c_#memory_$Pointer$.base| .cse40 (store (store (select |c_#memory_$Pointer$.base| .cse40) .cse41 (_ 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 (= .cse39 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse40 .cse39)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse41))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (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) (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 (= .cse42 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse43 .cse42)))))))) (or .cse4 (and .cse5 (or .cse9 (and .cse44 .cse45 .cse21)) (or .cse9 (and .cse46 (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 ((.cse47 (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| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) 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|))))) .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (or (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse48 (select (select (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|)))) .cse21) (or .cse29 .cse49) (or .cse50 .cse29) (or .cse51 .cse29) (or .cse9 .cse52) (or .cse9 (and .cse26 .cse27)) (or (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((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|))) (let ((.cse54 (select (select (store |c_#memory_$Pointer$.base| .cse53 (store (store (select |c_#memory_$Pointer$.base| .cse53) 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 (= .cse53 .cse54) (= .cse54 |c_ULTIMATE.start_main_~item~0#1.base|))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((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) (= .cse55 |c_ULTIMATE.start_main_~item~0#1.base|))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) .cse57 .cse17 .cse58 (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 ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse60 (select (select (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|))) (or (not (= .cse59 .cse60)) (= .cse60 |c_ULTIMATE.start_main_~item~0#1.base|))))))) .cse61 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse62 (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| .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|) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (= |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)) (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))) (let ((.cse64 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse64) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (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|))) (= .cse64 (_ bv0 32))))) (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 ((.cse66 (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| .cse66 (store (store (select |c_#memory_$Pointer$.base| .cse66) 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|)))) .cse67 .cse68 .cse69 .cse18 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (let ((.cse72 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (forall ((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|))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse71 (store (store (select |c_#memory_$Pointer$.base| .cse71) 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| .cse70) (= .cse71 .cse70))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse72) (= .cse72 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|))) (let ((.cse74 (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|))) (or (not (= .cse73 .cse74)) (= .cse74 |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))) (not (let ((.cse75 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse75 (select (select (store |c_#memory_$Pointer$.base| .cse75 (store (store (select |c_#memory_$Pointer$.base| .cse75) 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 ((.cse77 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse76 (select (select (store |c_#memory_$Pointer$.base| .cse77 (store (store (select |c_#memory_$Pointer$.base| .cse77) 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| .cse76) (= .cse77 .cse76))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (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 ((.cse78 (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| .cse78 (store (store (select |c_#memory_$Pointer$.base| .cse78) 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))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse80 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse79 (select (select (store |c_#memory_$Pointer$.base| .cse80 (store (store (select |c_#memory_$Pointer$.base| .cse80) 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| .cse79) (= .cse80 .cse79))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32))))) .cse81) (or .cse9 (and .cse57 .cse58 (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 ((.cse82 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse82 (select (select (store |c_#memory_$Pointer$.base| .cse82 (store (store (select |c_#memory_$Pointer$.base| .cse82) 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 (= 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 ((.cse83 (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| .cse83 (store (store (select |c_#memory_$Pointer$.base| .cse83) 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|))))))) .cse84 (or .cse85 .cse9) (or .cse9 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse87 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (not (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse86 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) v_arrayElimCell_136 (_ bv0 32)) .cse87 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse87 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (and .cse34 (or .cse46 .cse4) (or .cse4 .cse88) .cse84 (or .cse4 (and .cse89 .cse46 .cse44 .cse90 .cse45 .cse91)) .cse90 .cse35 .cse45 (or (and .cse89 .cse44) .cse4) (or .cse44 .cse4) .cse36 .cse91) .cse81) (or .cse1 (and (or .cse92 .cse21) (or .cse92 .cse2))) (or .cse1 .cse2) (or .cse93 .cse1 .cse2) (or .cse9 .cse94) (or .cse9 .cse49) .cse95 (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|)))))) (or .cse50 .cse9) (or .cse29 .cse94) (or .cse93 .cse1) .cse67 .cse68 (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 ((.cse97 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse98 (select (select (store |c_#memory_$Pointer$.base| .cse97 (store (store (select |c_#memory_$Pointer$.base| .cse97) 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 (= .cse97 .cse98) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse98))))))) (or .cse81 .cse27) (or .cse9 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse99 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse99 (select (select (store |c_#memory_$Pointer$.base| .cse99 (store (store (select |c_#memory_$Pointer$.base| .cse99) 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|))) .cse57 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (not (let ((.cse100 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse100 (select (select (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|)))))))) .cse28 (or .cse1 (and (or .cse9 .cse33) (or .cse33 .cse2) (or .cse29 .cse33))) .cse19 .cse20 (or .cse9 (and (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 ((.cse101 (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| .cse101 (store (store (select |c_#memory_$Pointer$.base| .cse101) 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 ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse102 (select (select (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) 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| .cse102) (= .cse103 .cse102))))) (= (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|))))) (or (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (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 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse9) (or .cse9 .cse30) (or .cse9 .cse51) (or .cse9 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse107 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (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)) .cse107 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse107 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or .cse85 .cse29) (or .cse9 .cse69) (or .cse9 (and .cse34 .cse108 .cse35 .cse36)) (or .cse9 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse109 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse109 (select (select (store |c_#memory_$Pointer$.base| .cse109 (store (store (select |c_#memory_$Pointer$.base| .cse109) (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) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) 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|)))))) (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 ((.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|)))))))) (or .cse29 .cse52) (or .cse1 .cse21)))))) is different from true [2022-07-23 05:28:05,220 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (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 ((.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|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse34 (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 ((.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|))))) (.cse22 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse118 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse117 (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| .cse117 (store (store (select |c_#memory_$Pointer$.base| .cse117) v_arrayElimCell_136 (_ bv0 32)) .cse118 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse118 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse1 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|)))) (.cse12 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse115 (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| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) (_ 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|)))) (.cse23 (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|)) (.cse114 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse112 (select (select (store |c_#memory_$Pointer$.base| .cse113 (store (store (select |c_#memory_$Pointer$.base| .cse113) v_arrayElimCell_136 (_ bv0 32)) .cse114 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| .cse112) (= .cse113 .cse112) (= .cse114 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse24 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|)) (.cse111 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse109 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) v_arrayElimCell_136 (_ bv0 32)) .cse111 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| .cse109) (= .cse110 .cse109) (= .cse111 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse25 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse108 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse107 (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| .cse107 (store (store (select |c_#memory_$Pointer$.base| .cse107) v_arrayElimCell_136 (_ bv0 32)) .cse108 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse108 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse26 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse106 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse105 (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| .cse105 (store (store (select |c_#memory_$Pointer$.base| .cse105) v_arrayElimCell_136 (_ bv0 32)) .cse106 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse106 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse104 (select (select (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) 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 (= .cse103 .cse104) (= .cse104 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse2 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse102 (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| .cse102 (store (store (select |c_#memory_$Pointer$.base| .cse102) 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|)))) (.cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse101 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse100 (select (select (store |c_#memory_$Pointer$.base| .cse101 (store (store (select |c_#memory_$Pointer$.base| .cse101) 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| .cse100) (= .cse101 .cse100)))))) (.cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse99 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse98 (select (select (store |c_#memory_$Pointer$.base| .cse99 (store (store (select |c_#memory_$Pointer$.base| .cse99) 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| .cse98) (= .cse99 .cse98) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse27 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (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)) (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|)))))) (.cse3 (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|))) (let ((.cse95 (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|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse95) (= .cse96 .cse95))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse20 (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 ((.cse94 (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| .cse94 (store (store (select |c_#memory_$Pointer$.base| .cse94) 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|)))))) (.cse21 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse93 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse92 (select (select (store |c_#memory_$Pointer$.base| .cse93 (store (store (select |c_#memory_$Pointer$.base| .cse93) 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| .cse92) (= .cse93 .cse92)))))))) (.cse39 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse91 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse90 (select (select (store |c_#memory_$Pointer$.base| .cse91 (store (store (select |c_#memory_$Pointer$.base| .cse91) 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| .cse90) (= .cse91 .cse90) (= .cse90 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse51 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select (let ((.cse89 (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| .cse89 (store (store (select |c_#memory_$Pointer$.base| .cse89) 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| .cse88) (= .cse88 |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse4 (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 ((.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|)))))) (.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse69 (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 ((.cse85 (select (select (let ((.cse86 (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| .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) (= .cse85 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (.cse10 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse84 (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| .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|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (and (or .cse0 (and .cse1 .cse2 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)))) (or .cse0 (and .cse3 .cse4)) (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)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (or .cse0 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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_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 (= .cse7 .cse8) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse8 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse9 .cse10 .cse11)) (or .cse0 .cse12) (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 ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse14 (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|))) (or (= .cse13 .cse14) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse14))))))) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ 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|)) (.cse17 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) .cse17 (_ 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 (= .cse15 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse16 .cse15)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse17))))) (forall ((v_arrayElimIndex_16 (_ 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|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse19 (store (store (select |c_#memory_$Pointer$.base| .cse19) (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 (= .cse18 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse19 .cse18)))))))) (or .cse0 (and .cse20 .cse21)) (or .cse0 (and .cse22 .cse23 .cse24 .cse25 .cse26)) (or .cse0 (and .cse9 .cse10)) (or .cse0 (and .cse27 .cse20 (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 ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse28 (select (select (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))) (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 ((.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)) (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|))))))) (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|))) (or .cse0 (and .cse30 .cse1 .cse2 .cse31)) (or .cse0 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse33 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (not (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse32 (select (select (store |c_#memory_$Pointer$.base| .cse32 (store (store (select |c_#memory_$Pointer$.base| .cse32) 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|)))) (= .cse33 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or .cse0 (and .cse34 .cse2)) (or .cse0 (and .cse1 .cse2)) (or .cse0 .cse2) (or .cse0 (forall ((v_arrayElimCell_136 (_ 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 v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) v_arrayElimCell_136 (_ bv0 32)) .cse37 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| .cse35) (= .cse36 .cse35) (= .cse37 (_ bv0 32))))))) (or .cse0 .cse10) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse38 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse38 (select (select (store |c_#memory_$Pointer$.base| .cse38 (store (store (select |c_#memory_$Pointer$.base| .cse38) 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 .cse0 (and .cse30 .cse34 .cse22 .cse1 .cse12 .cse23 .cse24 .cse2 .cse25 .cse26 .cse31)) .cse21 .cse39 (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 ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse41 (select (select (store |c_#memory_$Pointer$.base| .cse40 (store (store (select |c_#memory_$Pointer$.base| .cse40) 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 (= .cse40 .cse41) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse41))))))) (or .cse0 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse42 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse42 (select (select (store |c_#memory_$Pointer$.base| .cse42 (store (store (select |c_#memory_$Pointer$.base| .cse42) 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|))) .cse27 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (not (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse43 (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|)))))))) .cse11 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse44 (select (select (store |c_#memory_$Pointer$.base| .cse44 (store (store (select |c_#memory_$Pointer$.base| .cse44) 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 .cse2 .cse31)) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse45 (select (select (store |c_#memory_$Pointer$.base| .cse45 (store (store (select |c_#memory_$Pointer$.base| .cse45) 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)))) (or .cse0 (and .cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((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|))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$.base| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) 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| .cse46) (= .cse47 .cse46))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse31)) (or .cse0 (and (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 ((.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|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse50 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse49 (select (select (store |c_#memory_$Pointer$.base| .cse50 (store (store (select |c_#memory_$Pointer$.base| .cse50) 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| .cse49) (= .cse50 .cse49))))) (= (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|))))) (or (and .cse51 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse52 (select (select (let ((.cse53 (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| .cse53 (store (store (select |c_#memory_$Pointer$.base| .cse53) 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| .cse52) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse52 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse0) (or (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse55 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse54 (select (select (store |c_#memory_$Pointer$.base| .cse54 (store (store (select |c_#memory_$Pointer$.base| .cse54) v_arrayElimCell_136 (_ bv0 32)) .cse55 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse55 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse0) (or .cse0 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse56 (select (select (let ((.cse57 (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| .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|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse56) (= .cse56 |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse0 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse59 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (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)) .cse59 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse59 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or .cse0 .cse51) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse60 (select (select (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) (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) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse61 (select (select (store |c_#memory_$Pointer$.base| .cse61 (store (store (select |c_#memory_$Pointer$.base| .cse61) (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 ((.cse62 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse62 (select (select (store |c_#memory_$Pointer$.base| .cse62 (store (store (select |c_#memory_$Pointer$.base| .cse62) (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 .cse0 (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse64 (select (select (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|))) (or (= .cse63 .cse64) (= .cse64 |c_ULTIMATE.start_main_~item~0#1.base|))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((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|))) (let ((.cse65 (select (select (store |c_#memory_$Pointer$.base| .cse66 (store (store (select |c_#memory_$Pointer$.base| .cse66) 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| .cse65) (= .cse66 .cse65) (= .cse65 |c_ULTIMATE.start_main_~item~0#1.base|))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse27 .cse3 .cse20 (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 ((.cse68 (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 (not (= .cse67 .cse68)) (= .cse68 |c_ULTIMATE.start_main_~item~0#1.base|))))))) .cse69 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse70 (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| .cse70 (store (store (select |c_#memory_$Pointer$.base| .cse70) 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|)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse71 (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| .cse71 (store (store (select |c_#memory_$Pointer$.base| .cse71) 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))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse72 (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| .cse72 (store (store (select |c_#memory_$Pointer$.base| .cse72) 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|)))) .cse21 .cse39 .cse51 .cse4 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|))) (let ((.cse74 (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|))) (or (not (= .cse73 .cse74)) (= .cse74 |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))) (not (let ((.cse75 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse75 (select (select (store |c_#memory_$Pointer$.base| .cse75 (store (store (select |c_#memory_$Pointer$.base| .cse75) 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 ((.cse77 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse76 (select (select (store |c_#memory_$Pointer$.base| .cse77 (store (store (select |c_#memory_$Pointer$.base| .cse77) 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| .cse76) (= .cse77 .cse76))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (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 ((.cse78 (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| .cse78 (store (store (select |c_#memory_$Pointer$.base| .cse78) 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))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse80 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse79 (select (select (store |c_#memory_$Pointer$.base| .cse80 (store (store (select |c_#memory_$Pointer$.base| .cse80) 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| .cse79) (= .cse80 .cse79))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))))) (or .cse0 (and .cse69 .cse10 (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 ((.cse81 (select (select (let ((.cse82 (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| .cse82 (store (store (select |c_#memory_$Pointer$.base| .cse82) 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| .cse81) (= .cse81 |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 ((.cse83 (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| .cse83 (store (store (select |c_#memory_$Pointer$.base| .cse83) 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|)))))))) is different from true [2022-07-23 05:28:05,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:05,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:05,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:05,562 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-23 05:28:06,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:06,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:06,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:06,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:06,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:06,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:06,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:07,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:07,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:07,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:07,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:07,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:07,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:28:10,471 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-23 05:28:10,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:28:10,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624794634] [2022-07-23 05:28:10,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624794634] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:28:10,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:28:10,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2022-07-23 05:28:10,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136239687] [2022-07-23 05:28:10,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:28:10,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-23 05:28:10,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:28:10,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-23 05:28:10,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=5, NotChecked=78, Total=506 [2022-07-23 05:28:10,473 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-23 05:28:13,412 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (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 ((.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|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (.cse34 (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 ((.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|))))) (.cse22 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse118 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse117 (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| .cse117 (store (store (select |c_#memory_$Pointer$.base| .cse117) v_arrayElimCell_136 (_ bv0 32)) .cse118 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse118 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse1 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|)))) (.cse12 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse115 (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| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) (_ 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|)))) (.cse23 (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|)) (.cse114 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse112 (select (select (store |c_#memory_$Pointer$.base| .cse113 (store (store (select |c_#memory_$Pointer$.base| .cse113) v_arrayElimCell_136 (_ bv0 32)) .cse114 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| .cse112) (= .cse113 .cse112) (= .cse114 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse24 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|)) (.cse111 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse109 (select (select (store |c_#memory_$Pointer$.base| .cse110 (store (store (select |c_#memory_$Pointer$.base| .cse110) v_arrayElimCell_136 (_ bv0 32)) .cse111 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| .cse109) (= .cse110 .cse109) (= .cse111 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse25 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse108 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse107 (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| .cse107 (store (store (select |c_#memory_$Pointer$.base| .cse107) v_arrayElimCell_136 (_ bv0 32)) .cse108 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse108 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse26 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse106 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse105 (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| .cse105 (store (store (select |c_#memory_$Pointer$.base| .cse105) v_arrayElimCell_136 (_ bv0 32)) .cse106 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse106 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse104 (select (select (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) 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 (= .cse103 .cse104) (= .cse104 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse2 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse102 (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| .cse102 (store (store (select |c_#memory_$Pointer$.base| .cse102) 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|)))) (.cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse101 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse100 (select (select (store |c_#memory_$Pointer$.base| .cse101 (store (store (select |c_#memory_$Pointer$.base| .cse101) 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| .cse100) (= .cse101 .cse100)))))) (.cse31 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse99 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse98 (select (select (store |c_#memory_$Pointer$.base| .cse99 (store (store (select |c_#memory_$Pointer$.base| .cse99) 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| .cse98) (= .cse99 .cse98) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse27 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (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)) (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|)))))) (.cse3 (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|))) (let ((.cse95 (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|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse95) (= .cse96 .cse95))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse20 (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 ((.cse94 (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| .cse94 (store (store (select |c_#memory_$Pointer$.base| .cse94) 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|)))))) (.cse21 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse93 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse92 (select (select (store |c_#memory_$Pointer$.base| .cse93 (store (store (select |c_#memory_$Pointer$.base| .cse93) 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| .cse92) (= .cse93 .cse92)))))))) (.cse39 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse91 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse90 (select (select (store |c_#memory_$Pointer$.base| .cse91 (store (store (select |c_#memory_$Pointer$.base| .cse91) 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| .cse90) (= .cse91 .cse90) (= .cse90 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse51 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse88 (select (select (let ((.cse89 (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| .cse89 (store (store (select |c_#memory_$Pointer$.base| .cse89) 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| .cse88) (= .cse88 |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse4 (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 ((.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|)))))) (.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse69 (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 ((.cse85 (select (select (let ((.cse86 (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| .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) (= .cse85 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (.cse10 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse84 (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| .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|) |c_ULTIMATE.start_main_~item~0#1.base|)))) (and (= (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) .cse0 (or .cse0 (and .cse1 .cse2 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)))) (or .cse0 (and .cse3 .cse4)) (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)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (or .cse0 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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_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 (= .cse7 .cse8) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse8 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse9 .cse10 .cse11)) (or .cse0 .cse12) (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 ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse14 (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|))) (or (= .cse13 .cse14) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse14))))))) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ 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|)) (.cse17 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.base| .cse16 (store (store (select |c_#memory_$Pointer$.base| .cse16) .cse17 (_ 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 (= .cse15 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse16 .cse15)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse17))))) (forall ((v_arrayElimIndex_16 (_ 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|))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| .cse19 (store (store (select |c_#memory_$Pointer$.base| .cse19) (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 (= .cse18 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse19 .cse18)))))))) (or .cse0 (and .cse20 .cse21)) (or .cse0 (and .cse22 .cse23 .cse24 .cse25 .cse26)) (or .cse0 (and .cse9 .cse10)) (or .cse0 (and .cse27 .cse20 (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 ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse28 (select (select (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))) (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 ((.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)) (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|))))))) (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|))) (or .cse0 (and .cse30 .cse1 .cse2 .cse31)) (or .cse0 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse33 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (not (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse32 (select (select (store |c_#memory_$Pointer$.base| .cse32 (store (store (select |c_#memory_$Pointer$.base| .cse32) 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|)))) (= .cse33 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or .cse0 (and .cse34 .cse2)) (or .cse0 (and .cse1 .cse2)) (or .cse0 .cse2) (or .cse0 (forall ((v_arrayElimCell_136 (_ 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 v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse35 (select (select (store |c_#memory_$Pointer$.base| .cse36 (store (store (select |c_#memory_$Pointer$.base| .cse36) v_arrayElimCell_136 (_ bv0 32)) .cse37 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| .cse35) (= .cse36 .cse35) (= .cse37 (_ bv0 32))))))) (or .cse0 .cse10) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse38 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse38 (select (select (store |c_#memory_$Pointer$.base| .cse38 (store (store (select |c_#memory_$Pointer$.base| .cse38) 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 .cse0 (and .cse30 .cse34 .cse22 .cse1 .cse12 .cse23 .cse24 .cse2 .cse25 .cse26 .cse31)) .cse21 .cse39 (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 ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse41 (select (select (store |c_#memory_$Pointer$.base| .cse40 (store (store (select |c_#memory_$Pointer$.base| .cse40) 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 (= .cse40 .cse41) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse41))))))) (or .cse0 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse42 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse42 (select (select (store |c_#memory_$Pointer$.base| .cse42 (store (store (select |c_#memory_$Pointer$.base| .cse42) 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|))) .cse27 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (not (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse43 (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|)))))))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) .cse11 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse44 (select (select (store |c_#memory_$Pointer$.base| .cse44 (store (store (select |c_#memory_$Pointer$.base| .cse44) 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 .cse2 .cse31)) (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse45 (select (select (store |c_#memory_$Pointer$.base| .cse45 (store (store (select |c_#memory_$Pointer$.base| .cse45) 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)))) (or .cse0 (and .cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((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|))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$.base| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) 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| .cse46) (= .cse47 .cse46))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse31)) (or .cse0 (and (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 ((.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|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse50 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse49 (select (select (store |c_#memory_$Pointer$.base| .cse50 (store (store (select |c_#memory_$Pointer$.base| .cse50) 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| .cse49) (= .cse50 .cse49))))) (= (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|))))) (or (and .cse51 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse52 (select (select (let ((.cse53 (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| .cse53 (store (store (select |c_#memory_$Pointer$.base| .cse53) 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| .cse52) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse52 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse0) (or (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse55 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse54 (select (select (store |c_#memory_$Pointer$.base| .cse54 (store (store (select |c_#memory_$Pointer$.base| .cse54) v_arrayElimCell_136 (_ bv0 32)) .cse55 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse55 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse0) (or .cse0 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse56 (select (select (let ((.cse57 (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| .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|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse56) (= .cse56 |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse0 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse59 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (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)) .cse59 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse59 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or .cse0 .cse51) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse60 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse60 (select (select (store |c_#memory_$Pointer$.base| .cse60 (store (store (select |c_#memory_$Pointer$.base| .cse60) (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) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) v_arrayElimIndex_16) (not (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse61 (select (select (store |c_#memory_$Pointer$.base| .cse61 (store (store (select |c_#memory_$Pointer$.base| .cse61) (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 ((.cse62 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse62 (select (select (store |c_#memory_$Pointer$.base| .cse62 (store (store (select |c_#memory_$Pointer$.base| .cse62) (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 .cse0 (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse64 (select (select (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|))) (or (= .cse63 .cse64) (= .cse64 |c_ULTIMATE.start_main_~item~0#1.base|))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((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|))) (let ((.cse65 (select (select (store |c_#memory_$Pointer$.base| .cse66 (store (store (select |c_#memory_$Pointer$.base| .cse66) 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| .cse65) (= .cse66 .cse65) (= .cse65 |c_ULTIMATE.start_main_~item~0#1.base|))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse27 .cse3 .cse20 (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 ((.cse68 (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 (not (= .cse67 .cse68)) (= .cse68 |c_ULTIMATE.start_main_~item~0#1.base|))))))) .cse69 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse70 (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| .cse70 (store (store (select |c_#memory_$Pointer$.base| .cse70) 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|)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse71 (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| .cse71 (store (store (select |c_#memory_$Pointer$.base| .cse71) 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))) (or (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse72 (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| .cse72 (store (store (select |c_#memory_$Pointer$.base| .cse72) 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|)))) .cse21 .cse39 .cse51 .cse4 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|))) (let ((.cse74 (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|))) (or (not (= .cse73 .cse74)) (= .cse74 |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))) (not (let ((.cse75 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse75 (select (select (store |c_#memory_$Pointer$.base| .cse75 (store (store (select |c_#memory_$Pointer$.base| .cse75) 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 ((.cse77 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse76 (select (select (store |c_#memory_$Pointer$.base| .cse77 (store (store (select |c_#memory_$Pointer$.base| .cse77) 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| .cse76) (= .cse77 .cse76))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (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 ((.cse78 (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| .cse78 (store (store (select |c_#memory_$Pointer$.base| .cse78) 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))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse80 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse79 (select (select (store |c_#memory_$Pointer$.base| .cse80 (store (store (select |c_#memory_$Pointer$.base| .cse80) 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| .cse79) (= .cse80 .cse79))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))))) (or .cse0 (and .cse69 .cse10 (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 ((.cse81 (select (select (let ((.cse82 (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| .cse82 (store (store (select |c_#memory_$Pointer$.base| .cse82) 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| .cse81) (= .cse81 |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 ((.cse83 (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| .cse83 (store (store (select |c_#memory_$Pointer$.base| .cse83) 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|)))))))) is different from true [2022-07-23 05:28:15,456 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (= |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 ((.cse89 (forall ((v_arrayElimCell_136 (_ 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) 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| .cse170) (= .cse171 .cse170)))))) (.cse44 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|)))) (.cse91 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse168 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse167 (select (select (store |c_#memory_$Pointer$.base| .cse168 (store (store (select |c_#memory_$Pointer$.base| .cse168) 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| .cse167) (= .cse168 .cse167) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse46 (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 ((.cse166 (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| .cse166 (store (store (select |c_#memory_$Pointer$.base| .cse166) 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|))))) (.cse45 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (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)) (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|)))) (.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse24 (= |c_ULTIMATE.start_main_~item~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse92 (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse164 (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| .cse164 (store (store (select |c_#memory_$Pointer$.base| .cse164) (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|))) (.cse2 (not .cse5)) (.cse35 (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|)) (.cse163 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse161 (select (select (store |c_#memory_$Pointer$.base| .cse162 (store (store (select |c_#memory_$Pointer$.base| .cse162) v_arrayElimCell_136 (_ bv0 32)) .cse163 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| .cse161) (= .cse162 .cse161) (= .cse163 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (.cse36 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse160 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (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)) .cse160 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse160 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (let ((.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 ((.cse158 (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| .cse158 (store (store (select |c_#memory_$Pointer$.base| .cse158) 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|)))))) (.cse67 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse157 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse156 (select (select (store |c_#memory_$Pointer$.base| .cse157 (store (store (select |c_#memory_$Pointer$.base| .cse157) 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| .cse156) (= .cse157 .cse156)))))))) (.cse69 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse154 (select (select (let ((.cse155 (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| .cse155 (store (store (select |c_#memory_$Pointer$.base| .cse155) 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| .cse154) (= .cse154 |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse34 (or .cse5 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse148 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse147 (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| .cse147 (store (store (select |c_#memory_$Pointer$.base| .cse147) v_arrayElimCell_136 (_ bv0 32)) .cse148 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse148 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse35 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse150 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse151 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse149 (select (select (store |c_#memory_$Pointer$.base| .cse150 (store (store (select |c_#memory_$Pointer$.base| .cse150) v_arrayElimCell_136 (_ bv0 32)) .cse151 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| .cse149) (= .cse150 .cse149) (= .cse151 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse153 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse152 (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| .cse152 (store (store (select |c_#memory_$Pointer$.base| .cse152) v_arrayElimCell_136 (_ bv0 32)) .cse153 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse153 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse36))) (.cse108 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse146 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse145 (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| .cse145 (store (store (select |c_#memory_$Pointer$.base| .cse145) v_arrayElimCell_136 (_ bv0 32)) .cse146 v_ArrVal_883))) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse146 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse21 (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32))) (.cse4 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse144 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse144 (select (select (store |c_#memory_$Pointer$.base| .cse144 (store (store (select |c_#memory_$Pointer$.base| .cse144) (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|))))) (.cse61 (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 ((.cse142 (select (select (let ((.cse143 (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| .cse143 (store (store (select |c_#memory_$Pointer$.base| .cse143) 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| .cse142) (= .cse142 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (.cse28 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse141 (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| .cse141 (store (store (select |c_#memory_$Pointer$.base| .cse141) 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|))) (.cse95 (or .cse92 .cse2)) (.cse1 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (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) (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|)))) (.cse81 (and .cse0 .cse24)) (.cse90 (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse139 (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| .cse139 (store (store (select |c_#memory_$Pointer$.base| .cse139) (_ 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|)))) (.cse10 (and .cse46 .cse45)) (.cse138 (and .cse89 .cse44 .cse45 .cse91)) (.cse88 (and .cse45 .cse91)) (.cse137 (and .cse44 .cse45))) (let ((.cse6 (or .cse24 .cse137)) (.cse7 (or .cse24 .cse88)) (.cse8 (or .cse24 .cse138)) (.cse9 (or .cse0 .cse138)) (.cse11 (or .cse0 .cse137)) (.cse12 (or .cse0 .cse45)) (.cse13 (or .cse24 .cse45)) (.cse14 (or .cse0 .cse88)) (.cse15 (or .cse24 .cse10)) (.cse16 (or .cse81 .cse90)) (.cse27 (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 ((.cse136 (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| .cse136 (store (store (select |c_#memory_$Pointer$.base| .cse136) 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|)))) (.cse17 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse135 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse134 (select (select (store |c_#memory_$Pointer$.base| .cse135 (store (store (select |c_#memory_$Pointer$.base| .cse135) 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| .cse134) (= .cse135 .cse134))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (.cse18 (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 ((.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) 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|)))))) (.cse84 (or .cse1 .cse2)) (.cse49 (and (or (and .cse61 .cse28) .cse5) .cse95 (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 ((.cse130 (select (select (let ((.cse131 (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| .cse131 (store (store (select |c_#memory_$Pointer$.base| .cse131) 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| .cse130) (= .cse130 |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 ((.cse132 (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| .cse132 (store (store (select |c_#memory_$Pointer$.base| .cse132) 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|)))))) (.cse50 (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse129 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse128 (select (select (store |c_#memory_$Pointer$.base| .cse129 (store (store (select |c_#memory_$Pointer$.base| .cse129) 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| .cse128) (= .cse129 .cse128))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|))) .cse91 (or .cse89 .cse5))) (.cse94 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse126 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse127 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (let ((.cse125 (select (select (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|))) (or (= v_arrayElimCell_136 (_ bv0 32)) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse125) (= .cse126 .cse125) (= .cse127 (_ bv0 32))))))) (.cse93 (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse123 (select (select (let ((.cse124 (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| .cse124 (store (store (select |c_#memory_$Pointer$.base| .cse124) (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 (= .cse123 |c_ULTIMATE.start_main_~item~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse123))))) (.cse68 (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|))) (let ((.cse121 (select (select (store |c_#memory_$Pointer$.base| .cse122 (store (store (select |c_#memory_$Pointer$.base| .cse122) 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| .cse121) (= .cse122 .cse121) (= .cse121 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse57 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse120 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse120 (select (select (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|)))))) (.cse29 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse118 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse119 (select (select (store |c_#memory_$Pointer$.base| .cse118 (store (store (select |c_#memory_$Pointer$.base| .cse118) 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 (= .cse118 .cse119) (= .cse119 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse3 (= (bvadd (_ bv4294967292 32) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) (.cse33 (and .cse1 .cse4)) (.cse19 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse117 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse117 (select (select (store |c_#memory_$Pointer$.base| .cse117 (store (store (select |c_#memory_$Pointer$.base| .cse117) 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)))) (.cse20 (forall ((v_arrayElimIndex_16 (_ BitVec 32))) (or (= v_arrayElimIndex_16 (_ bv0 32)) (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse116 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse116 (select (select (store |c_#memory_$Pointer$.base| .cse116 (store (store (select |c_#memory_$Pointer$.base| .cse116) 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))))) (.cse30 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse114 (select (select (let ((.cse115 (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| .cse115 (store (store (select |c_#memory_$Pointer$.base| .cse115) 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| .cse114) (= .cse114 |c_ULTIMATE.start_main_~item~0#1.base|))))) (.cse51 (and .cse34 .cse108 .cse35 .cse21 .cse36)) (.cse85 (and (or .cse5 .cse69) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse112 (select (select (let ((.cse113 (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| .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 (= |c_ULTIMATE.start_main_~head~0#1.base| .cse112) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse112 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (.cse52 (and .cse58 .cse67))) (and .cse0 (or .cse1 .cse2 .cse3) (or .cse4 .cse2 .cse3) (or .cse5 (and .cse6 .cse7 .cse8 .cse9 (or .cse0 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (or .cse0 (and .cse17 .cse18)) (or (and .cse19 .cse20) .cse21) (or .cse0 (forall ((v_ArrVal_883 (_ BitVec 32)) (v_arrayElimCell_140 (_ BitVec 32)) (v_arrayElimCell_141 (_ BitVec 32))) (= (select (let ((.cse22 (let ((.cse23 (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| .cse23 (store (store (select |c_#memory_$Pointer$.base| .cse23) v_arrayElimCell_141 (_ bv0 32)) (bvadd v_arrayElimCell_141 (_ bv4 32)) v_ArrVal_883))))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) v_arrayElimCell_140) (_ bv0 32)))) .cse24 (or .cse0 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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_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 (= .cse25 .cse26) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse26 |c_ULTIMATE.start_main_~item~0#1.base|))))) .cse27 .cse28 .cse29)) (or .cse24 .cse30) (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 ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| .cse31 (store (store (select |c_#memory_$Pointer$.base| .cse31) 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 (= .cse31 .cse32) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse32))))))) (or .cse33 .cse2 (and .cse0 .cse24 .cse3)) (or .cse24 (and .cse34 .cse35 .cse36)) (or .cse2 (forall ((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|))) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse37 (store (store (select |c_#memory_$Pointer$.base| .cse37) (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 (not (= .cse37 .cse38)) (= .cse38 |c_ULTIMATE.start_main_~item~0#1.base|)))))) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)) (.cse41 (bvadd (_ bv4294967292 32) v_arrayElimIndex_16))) (let ((.cse39 (select (select (store |c_#memory_$Pointer$.base| .cse40 (store (store (select |c_#memory_$Pointer$.base| .cse40) .cse41 (_ 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 (= .cse39 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse40 .cse39)) (= |c_ULTIMATE.start_main_~head~0#1.offset| .cse41))))) (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (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) (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 (= .cse42 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse43 .cse42)))))))) (or .cse5 (and .cse6 (or .cse0 (and .cse44 .cse45 .cse21)) (or .cse0 (and .cse46 (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 ((.cse47 (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| .cse47 (store (store (select |c_#memory_$Pointer$.base| .cse47) 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|))))) .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (or (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse48 (select (select (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|)))) .cse21) (or .cse24 .cse49) (or .cse50 .cse24) (or .cse51 .cse24) (or .cse0 .cse52) (or .cse0 (and .cse27 .cse28)) (or (and (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((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|))) (let ((.cse54 (select (select (store |c_#memory_$Pointer$.base| .cse53 (store (store (select |c_#memory_$Pointer$.base| .cse53) 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 (= .cse53 .cse54) (= .cse54 |c_ULTIMATE.start_main_~item~0#1.base|))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((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) (= .cse55 |c_ULTIMATE.start_main_~item~0#1.base|))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) .cse57 .cse17 .cse58 (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 ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse60 (select (select (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|))) (or (not (= .cse59 .cse60)) (= .cse60 |c_ULTIMATE.start_main_~item~0#1.base|))))))) .cse61 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (= (select (select (let ((.cse62 (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| .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|) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (forall ((v_arrayElimCell_136 (_ BitVec 32))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (= |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)) (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))) (let ((.cse64 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse64) (forall ((v_ArrVal_883 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (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|))) (= .cse64 (_ bv0 32))))) (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 ((.cse66 (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| .cse66 (store (store (select |c_#memory_$Pointer$.base| .cse66) 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|)))) .cse67 .cse68 .cse69 .cse18 (forall ((v_arrayElimCell_136 (_ BitVec 32))) (let ((.cse72 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (forall ((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|))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse71 (store (store (select |c_#memory_$Pointer$.base| .cse71) 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| .cse70) (= .cse71 .cse70))))) (= |c_ULTIMATE.start_main_~item~0#1.offset| .cse72) (= .cse72 (_ bv0 32))))) (forall ((v_arrayElimCell_136 (_ BitVec 32)) (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|))) (let ((.cse74 (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|))) (or (not (= .cse73 .cse74)) (= .cse74 |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))) (not (let ((.cse75 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse75 (select (select (store |c_#memory_$Pointer$.base| .cse75 (store (store (select |c_#memory_$Pointer$.base| .cse75) 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 ((.cse77 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse76 (select (select (store |c_#memory_$Pointer$.base| .cse77 (store (store (select |c_#memory_$Pointer$.base| .cse77) 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| .cse76) (= .cse77 .cse76))))) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32)))) (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 ((.cse78 (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| .cse78 (store (store (select |c_#memory_$Pointer$.base| .cse78) 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))) (or (forall ((v_ArrVal_883 (_ BitVec 32))) (let ((.cse80 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse79 (select (select (store |c_#memory_$Pointer$.base| .cse80 (store (store (select |c_#memory_$Pointer$.base| .cse80) 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| .cse79) (= .cse80 .cse79))))) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (bvadd v_arrayElimCell_136 (_ bv4 32)) (_ bv0 32))))) .cse81) (or .cse0 (and .cse57 .cse58 (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 ((.cse82 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse82 (select (select (store |c_#memory_$Pointer$.base| .cse82 (store (store (select |c_#memory_$Pointer$.base| .cse82) 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 (= 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 ((.cse83 (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| .cse83 (store (store (select |c_#memory_$Pointer$.base| .cse83) 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|))))))) .cse84 .cse2 (or .cse85 .cse0) (or .cse0 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse87 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (= v_arrayElimCell_136 (_ bv0 32)) (not (let ((.cse86 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse86 (select (select (store |c_#memory_$Pointer$.base| .cse86 (store (store (select |c_#memory_$Pointer$.base| .cse86) v_arrayElimCell_136 (_ bv0 32)) .cse87 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse87 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (and .cse34 (or .cse46 .cse5) (or .cse5 .cse88) .cse84 (or .cse5 (and .cse89 .cse46 .cse44 .cse90 .cse45 .cse91)) .cse90 .cse35 .cse45 (or (and .cse89 .cse44) .cse5) (or .cse44 .cse5) .cse36 .cse91) .cse81) (or .cse2 (and (or .cse92 .cse21) (or .cse92 .cse3))) (or .cse2 .cse3) (or .cse93 .cse2 .cse3) (or .cse0 .cse94) (or .cse0 .cse49) .cse95 (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|)))))) (or .cse50 .cse0) (or .cse24 .cse94) (or .cse93 .cse2) .cse67 .cse68 (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 ((.cse97 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse98 (select (select (store |c_#memory_$Pointer$.base| .cse97 (store (store (select |c_#memory_$Pointer$.base| .cse97) 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 (= .cse97 .cse98) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse98))))))) (or .cse81 .cse28) (or .cse0 (and (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (not (let ((.cse99 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse99 (select (select (store |c_#memory_$Pointer$.base| .cse99 (store (store (select |c_#memory_$Pointer$.base| .cse99) 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|))) .cse57 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (or (= v_arrayElimCell_136 (_ bv0 32)) (not (let ((.cse100 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse100 (select (select (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|)))))))) .cse29 (or .cse2 (and (or .cse0 .cse33) (or .cse33 .cse3) (or .cse24 .cse33))) .cse19 .cse20 (or .cse0 (and (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 ((.cse101 (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| .cse101 (store (store (select |c_#memory_$Pointer$.base| .cse101) 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 ((.cse103 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse102 (select (select (store |c_#memory_$Pointer$.base| .cse103 (store (store (select |c_#memory_$Pointer$.base| .cse103) 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| .cse102) (= .cse103 .cse102))))) (= (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|))))) (or (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse105 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (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 |c_ULTIMATE.start_main_~head~0#1.offset|) (= v_arrayElimCell_136 |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse0) (or .cse0 .cse30) (or .cse0 .cse51) (or .cse0 (forall ((v_arrayElimCell_136 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (let ((.cse107 (bvadd v_arrayElimCell_136 (_ bv4 32)))) (or (not (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)) .cse107 v_ArrVal_883)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= .cse107 |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or .cse85 .cse24) (or .cse0 .cse69) (or .cse0 (and .cse34 .cse108 .cse35 .cse36)) (or .cse0 (and (forall ((v_arrayElimIndex_16 (_ BitVec 32)) (v_ArrVal_883 (_ BitVec 32))) (not (let ((.cse109 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= .cse109 (select (select (store |c_#memory_$Pointer$.base| .cse109 (store (store (select |c_#memory_$Pointer$.base| .cse109) (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) (= (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32)) 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|)))))) (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 ((.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|)))))))) (or .cse24 .cse52) (or .cse2 .cse21)))))) is different from true [2022-07-23 05:28:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:20,855 INFO L93 Difference]: Finished difference Result 248 states and 268 transitions. [2022-07-23 05:28:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 05:28:20,856 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-23 05:28:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:20,857 INFO L225 Difference]: With dead ends: 248 [2022-07-23 05:28:20,857 INFO L226 Difference]: Without dead ends: 248 [2022-07-23 05:28:20,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=97, Invalid=562, Unknown=7, NotChecked=204, Total=870 [2022-07-23 05:28:20,857 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 179 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:20,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1204 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 507 Invalid, 0 Unknown, 605 Unchecked, 4.8s Time] [2022-07-23 05:28:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-23 05:28:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2022-07-23 05:28:20,860 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-23 05:28:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 266 transitions. [2022-07-23 05:28:20,860 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 266 transitions. Word has length 44 [2022-07-23 05:28:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:20,861 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 266 transitions. [2022-07-23 05:28:20,861 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-23 05:28:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 266 transitions. [2022-07-23 05:28:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:28:20,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:20,861 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-23 05:28:20,871 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-23 05:28:21,069 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-23 05:28:21,069 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-23 05:28:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash 813102997, now seen corresponding path program 1 times [2022-07-23 05:28:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:28:21,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103464496] [2022-07-23 05:28:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:21,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:28:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:28:21,071 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-23 05:28:21,073 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-23 05:28:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:21,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 05:28:21,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:28:21,250 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-23 05:28:21,583 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:28:21,583 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-23 05:28:21,768 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-23 05:28:22,554 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:28:22,554 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-23 05:28:22,778 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:28:22,778 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-23 05:28:23,152 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:28:23,152 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-23 05:28:23,482 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:28:23,483 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-23 05:28:24,557 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:28:24,557 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-23 05:28:24,613 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-23 05:28:25,383 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:28:25,384 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-23 05:28:25,462 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-23 05:28:26,302 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-23 05:28:26,520 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-23 05:28:26,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:28:27,248 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-23 05:28:27,883 INFO L356 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2022-07-23 05:28:27,884 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-23 05:28:27,926 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-23 05:28:27,990 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-23 05:28:28,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:28,811 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-23 05:28:28,867 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-23 05:28:29,011 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-23 05:28:29,076 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-23 05:28:29,162 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:29,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, 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-23 05:28:29,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:29,252 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-23 05:28:29,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:29,325 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-23 05:28:29,344 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-23 05:28:29,443 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:28:29,443 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-23 05:28:30,359 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-23 05:28:30,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:28:30,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103464496] [2022-07-23 05:28:30,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103464496] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:28:30,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:28:30,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-07-23 05:28:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579775871] [2022-07-23 05:28:30,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:28:30,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 05:28:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:28:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 05:28:30,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=21, NotChecked=234, Total=600 [2022-07-23 05:28:30,362 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-23 05:28:39,464 WARN L233 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:28:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:28:43,023 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2022-07-23 05:28:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 05:28:43,024 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-23 05:28:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:28:43,025 INFO L225 Difference]: With dead ends: 250 [2022-07-23 05:28:43,025 INFO L226 Difference]: Without dead ends: 250 [2022-07-23 05:28:43,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=100, Invalid=451, Unknown=25, NotChecked=294, Total=870 [2022-07-23 05:28:43,026 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 28 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 918 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:28:43,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1613 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 435 Invalid, 0 Unknown, 918 Unchecked, 4.0s Time] [2022-07-23 05:28:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-23 05:28:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2022-07-23 05:28:43,029 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-23 05:28:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 270 transitions. [2022-07-23 05:28:43,029 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 270 transitions. Word has length 44 [2022-07-23 05:28:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:28:43,029 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 270 transitions. [2022-07-23 05:28:43,030 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-23 05:28:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 270 transitions. [2022-07-23 05:28:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:28:43,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:28:43,030 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-23 05:28:43,038 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-23 05:28:43,234 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-23 05:28:43,235 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-23 05:28:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:28:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 813102998, now seen corresponding path program 1 times [2022-07-23 05:28:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:28:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725271997] [2022-07-23 05:28:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:28:43,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:28:43,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:28:43,237 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-23 05:28:43,237 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-23 05:28:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:28:43,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-23 05:28:43,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:28:43,416 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-23 05:28:43,718 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:28:43,719 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-23 05:28:43,946 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-23 05:28:44,000 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-23 05:28:44,931 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:28:44,931 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-23 05:28:45,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:45,017 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-23 05:28:45,253 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:28:45,253 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-23 05:28:45,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:28:45,333 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-23 05:28:45,928 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:28:45,928 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-23 05:28:46,308 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:28:46,309 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-23 05:28:46,381 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-23 05:28:47,644 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:28:47,644 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-23 05:28:47,766 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:28:47,766 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-23 05:28:47,824 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-23 05:28:48,693 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-23 05:28:48,694 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-23 05:28:48,820 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:28:48,820 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-23 05:28:48,841 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-23 05:28:49,947 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-23 05:28:49,964 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-23 05:28:50,242 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-23 05:28:50,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:28:51,505 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-23 05:28:51,694 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-23 05:28:51,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:51,787 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-23 05:28:52,016 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-23 05:28:52,210 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-23 05:28:54,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:54,000 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-23 05:28:54,162 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-23 05:28:54,621 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-23 05:28:54,805 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-23 05:28:55,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:55,016 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 138 treesize of output 115 [2022-07-23 05:28:55,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:55,063 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 115 treesize of output 115 [2022-07-23 05:28:55,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:55,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 169 [2022-07-23 05:28:55,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:55,642 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 400 treesize of output 379 [2022-07-23 05:28:55,673 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 363 treesize of output 355 [2022-07-23 05:28:55,708 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 355 treesize of output 351 [2022-07-23 05:28:55,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:55,941 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 404 treesize of output 407 [2022-07-23 05:28:56,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:28:56,068 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 431 treesize of output 411 [2022-07-23 05:28:56,096 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 369 treesize of output 365 [2022-07-23 05:28:56,124 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 365 treesize of output 349 [2022-07-23 05:28:56,168 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 349 treesize of output 341 [2022-07-23 05:28:56,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 341 treesize of output 337 [2022-07-23 05:28:56,228 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 337 treesize of output 335 [2022-07-23 05:29:09,560 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-23 05:29:09,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 05:29:09,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725271997] [2022-07-23 05:29:09,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725271997] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:29:09,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 05:29:09,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 05:29:09,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127488698] [2022-07-23 05:29:09,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 05:29:09,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-23 05:29:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 05:29:09,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-23 05:29:09,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=328, Unknown=9, NotChecked=294, Total=702 [2022-07-23 05:29:09,562 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-23 05:29:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:29:31,555 INFO L93 Difference]: Finished difference Result 285 states and 308 transitions. [2022-07-23 05:29:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:29:31,557 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-23 05:29:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:29:31,558 INFO L225 Difference]: With dead ends: 285 [2022-07-23 05:29:31,558 INFO L226 Difference]: Without dead ends: 285 [2022-07-23 05:29:31,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=153, Invalid=794, Unknown=11, NotChecked=448, Total=1406 [2022-07-23 05:29:31,559 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 202 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1231 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-23 05:29:31,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1229 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 960 Invalid, 0 Unknown, 1231 Unchecked, 9.8s Time] [2022-07-23 05:29:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-23 05:29:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 249. [2022-07-23 05:29:31,562 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-23 05:29:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 269 transitions. [2022-07-23 05:29:31,562 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 269 transitions. Word has length 44 [2022-07-23 05:29:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:29:31,563 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 269 transitions. [2022-07-23 05:29:31,563 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-23 05:29:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 269 transitions. [2022-07-23 05:29:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 05:29:31,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:29:31,564 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-23 05:29:31,575 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-23 05:29:31,775 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-23 05:29:31,775 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-23 05:29:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:29:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1823961394, now seen corresponding path program 2 times [2022-07-23 05:29:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 05:29:31,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018630404] [2022-07-23 05:29:31,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:29:31,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 05:29:31,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 05:29:31,777 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-23 05:29:31,778 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-23 05:29:31,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:29:31,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:29:31,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 05:29:31,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:29:31,946 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-23 05:29:32,273 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:29:32,274 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-23 05:29:32,443 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-23 05:29:32,481 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-23 05:29:33,381 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-23 05:29:33,382 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-23 05:29:33,614 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-23 05:29:33,614 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-23 05:29:34,333 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-23 05:29:34,334 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-23 05:29:34,442 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-23 05:29:34,442 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-23 05:29:36,777 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-23 05:29:36,778 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-23 05:29:36,797 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-23 05:29:37,487 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-23 05:29:37,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:29:59,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:29:59,524 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 113463 treesize of output 103619 [2022-07-23 05:30:03,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:30:03,408 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 116942 treesize of output 115958 [2022-07-23 05:30:03,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:30:03,900 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 129658 treesize of output 114218