./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c 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/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 07:12:31,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:12:31,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:12:31,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:12:31,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:12:31,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:12:31,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:12:31,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:12:31,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:12:31,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:12:31,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:12:31,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:12:31,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:12:31,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:12:31,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:12:31,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:12:31,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:12:31,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:12:31,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:12:31,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:12:31,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:12:31,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:12:31,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:12:31,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:12:31,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:12:31,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:12:31,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:12:31,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:12:31,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:12:31,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:12:31,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:12:31,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:12:31,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:12:31,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:12:31,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:12:31,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:12:31,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:12:31,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:12:31,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:12:31,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:12:31,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:12:31,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-02-18 07:12:31,510 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:12:31,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:12:31,511 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:12:31,511 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:12:31,512 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:12:31,512 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:12:31,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:12:31,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:12:31,517 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:12:31,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:12:31,518 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:12:31,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 07:12:31,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:12:31,518 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 07:12:31,518 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 07:12:31,518 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 07:12:31,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:12:31,518 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 07:12:31,519 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:12:31,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:12:31,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:12:31,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:12:31,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:12:31,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:12:31,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:12:31,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 07:12:31,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 07:12:31,520 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:12:31,520 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:12:31,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:12:31,521 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:12:31,521 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 [2023-02-18 07:12:31,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:12:31,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:12:31,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:12:31,735 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:12:31,736 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:12:31,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2023-02-18 07:12:32,631 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:12:32,848 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:12:32,852 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2023-02-18 07:12:32,874 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afa4e217/0695f26d03f849bc84cab5cc9fb3dd93/FLAG597c4877e [2023-02-18 07:12:32,887 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8afa4e217/0695f26d03f849bc84cab5cc9fb3dd93 [2023-02-18 07:12:32,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:12:32,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:12:32,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:12:32,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:12:32,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:12:32,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:12:32" (1/1) ... [2023-02-18 07:12:32,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55951ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:32, skipping insertion in model container [2023-02-18 07:12:32,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:12:32" (1/1) ... [2023-02-18 07:12:32,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:12:32,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:12:33,422 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-18 07:12:33,426 WARN L623 FunctionHandler]: Unknown extern function gethostid [2023-02-18 07:12:33,450 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-18 07:12:33,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:12:33,479 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-18 07:12:33,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e9d06e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:33, skipping insertion in model container [2023-02-18 07:12:33,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:12:33,481 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-18 07:12:33,482 INFO L158 Benchmark]: Toolchain (without parser) took 591.30ms. Allocated memory is still 115.3MB. Free memory was 70.3MB in the beginning and 49.5MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-18 07:12:33,482 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:12:33,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.90ms. Allocated memory is still 115.3MB. Free memory was 69.9MB in the beginning and 49.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-18 07:12:33,484 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.15ms. Allocated memory is still 115.3MB. Free memory was 87.5MB in the beginning and 87.3MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.90ms. Allocated memory is still 115.3MB. Free memory was 69.9MB in the beginning and 49.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1774]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 07:12:35,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:12:35,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:12:35,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:12:35,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:12:35,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:12:35,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:12:35,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:12:35,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:12:35,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:12:35,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:12:35,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:12:35,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:12:35,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:12:35,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:12:35,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:12:35,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:12:35,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:12:35,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:12:35,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:12:35,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:12:35,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:12:35,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:12:35,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:12:35,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:12:35,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:12:35,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:12:35,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:12:35,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:12:35,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:12:35,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:12:35,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:12:35,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:12:35,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:12:35,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:12:35,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:12:35,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:12:35,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:12:35,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:12:35,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:12:35,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:12:35,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-02-18 07:12:35,112 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:12:35,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:12:35,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:12:35,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:12:35,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:12:35,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:12:35,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:12:35,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:12:35,115 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:12:35,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:12:35,116 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:12:35,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 07:12:35,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:12:35,117 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 07:12:35,117 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 07:12:35,117 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 07:12:35,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:12:35,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 07:12:35,117 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 07:12:35,117 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 07:12:35,118 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:12:35,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:12:35,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:12:35,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:12:35,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:12:35,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:12:35,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:12:35,119 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 07:12:35,119 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 07:12:35,119 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:12:35,119 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:12:35,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:12:35,119 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 07:12:35,119 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:12:35,120 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 [2023-02-18 07:12:35,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:12:35,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:12:35,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:12:35,384 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:12:35,384 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:12:35,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2023-02-18 07:12:36,492 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:12:36,786 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:12:36,786 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2023-02-18 07:12:36,803 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/621c5869b/21e65481bafd416e945347fa315def67/FLAG39a9b0f2a [2023-02-18 07:12:36,814 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/621c5869b/21e65481bafd416e945347fa315def67 [2023-02-18 07:12:36,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:12:36,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:12:36,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:12:36,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:12:36,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:12:36,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:12:36" (1/1) ... [2023-02-18 07:12:36,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124d1a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:36, skipping insertion in model container [2023-02-18 07:12:36,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:12:36" (1/1) ... [2023-02-18 07:12:36,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:12:36,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:12:37,498 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-18 07:12:37,504 WARN L623 FunctionHandler]: Unknown extern function gethostid [2023-02-18 07:12:37,520 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-18 07:12:37,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:12:37,550 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-18 07:12:37,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:12:37,590 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-18 07:12:37,592 WARN L623 FunctionHandler]: Unknown extern function gethostid [2023-02-18 07:12:37,602 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-18 07:12:37,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:12:37,623 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 07:12:37,662 WARN L623 FunctionHandler]: Unknown extern function fflush [2023-02-18 07:12:37,669 WARN L623 FunctionHandler]: Unknown extern function gethostid [2023-02-18 07:12:37,679 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-18 07:12:37,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:12:37,797 INFO L208 MainTranslator]: Completed translation [2023-02-18 07:12:37,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37 WrapperNode [2023-02-18 07:12:37,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:12:37,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 07:12:37,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 07:12:37,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 07:12:37,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,866 INFO L138 Inliner]: procedures = 529, calls = 61, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 130 [2023-02-18 07:12:37,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 07:12:37,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 07:12:37,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 07:12:37,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 07:12:37,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,912 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 07:12:37,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 07:12:37,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 07:12:37,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 07:12:37,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (1/1) ... [2023-02-18 07:12:37,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:12:37,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:12:37,952 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) [2023-02-18 07:12:37,964 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 [2023-02-18 07:12:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 07:12:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 07:12:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 07:12:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-02-18 07:12:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 07:12:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 07:12:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 07:12:37,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 07:12:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 07:12:37,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 07:12:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 07:12:37,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-18 07:12:38,210 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 07:12:38,211 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 07:12:38,570 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 07:12:38,574 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 07:12:38,575 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-18 07:12:38,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:12:38 BoogieIcfgContainer [2023-02-18 07:12:38,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 07:12:38,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 07:12:38,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 07:12:38,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 07:12:38,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:12:36" (1/3) ... [2023-02-18 07:12:38,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763bfd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:12:38, skipping insertion in model container [2023-02-18 07:12:38,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:12:37" (2/3) ... [2023-02-18 07:12:38,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763bfd03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:12:38, skipping insertion in model container [2023-02-18 07:12:38,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:12:38" (3/3) ... [2023-02-18 07:12:38,582 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid.i [2023-02-18 07:12:38,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 07:12:38,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-02-18 07:12:38,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 07:12:38,635 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@25e25fe1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 07:12:38,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-02-18 07:12:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 92 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-18 07:12:38,642 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:38,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-18 07:12:38,643 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:38,647 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-18 07:12:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:38,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423609986] [2023-02-18 07:12:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:12:38,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:38,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:38,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:38,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-18 07:12:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:12:38,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:12:38,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:38,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 07:12:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:12:38,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:12:38,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:38,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423609986] [2023-02-18 07:12:38,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423609986] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:12:38,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:12:38,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 07:12:38,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981369784] [2023-02-18 07:12:38,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:12:38,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:12:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:12:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:12:38,893 INFO L87 Difference]: Start difference. First operand has 95 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 92 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) 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) [2023-02-18 07:12:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:12:39,077 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2023-02-18 07:12:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:12:39,079 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 [2023-02-18 07:12:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:12:39,086 INFO L225 Difference]: With dead ends: 109 [2023-02-18 07:12:39,086 INFO L226 Difference]: Without dead ends: 107 [2023-02-18 07:12:39,087 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 [2023-02-18 07:12:39,092 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 70 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:12:39,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:12:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-18 07:12:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2023-02-18 07:12:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 88 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2023-02-18 07:12:39,126 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 3 [2023-02-18 07:12:39,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:12:39,127 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2023-02-18 07:12:39,127 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) [2023-02-18 07:12:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2023-02-18 07:12:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-18 07:12:39,128 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:39,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-18 07:12:39,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 07:12:39,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:39,337 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:39,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-18 07:12:39,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:39,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166538665] [2023-02-18 07:12:39,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:12:39,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:39,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:39,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:39,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-18 07:12:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:12:39,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:12:39,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:39,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 07:12:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:12:39,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:12:39,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:39,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166538665] [2023-02-18 07:12:39,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166538665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:12:39,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:12:39,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 07:12:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854965055] [2023-02-18 07:12:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:12:39,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:12:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:39,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:12:39,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:12:39,461 INFO L87 Difference]: Start difference. First operand 91 states and 95 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) [2023-02-18 07:12:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:12:39,676 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2023-02-18 07:12:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:12:39,677 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 [2023-02-18 07:12:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:12:39,680 INFO L225 Difference]: With dead ends: 90 [2023-02-18 07:12:39,680 INFO L226 Difference]: Without dead ends: 90 [2023-02-18 07:12:39,680 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 [2023-02-18 07:12:39,681 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:12:39,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:12:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-18 07:12:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-18 07:12:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 87 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-02-18 07:12:39,686 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 3 [2023-02-18 07:12:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:12:39,687 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-02-18 07:12:39,687 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) [2023-02-18 07:12:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-02-18 07:12:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 07:12:39,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:39,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 07:12:39,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-18 07:12:39,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:39,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:39,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:39,893 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2023-02-18 07:12:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:39,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323325300] [2023-02-18 07:12:39,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:12:39,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:39,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:39,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-18 07:12:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:12:39,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:12:39,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:39,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 07:12:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:12:40,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:12:40,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:40,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323325300] [2023-02-18 07:12:40,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323325300] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:12:40,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:12:40,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:12:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566355779] [2023-02-18 07:12:40,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:12:40,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:12:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:40,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:12:40,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:12:40,006 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:12:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:12:40,223 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2023-02-18 07:12:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:12:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-18 07:12:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:12:40,224 INFO L225 Difference]: With dead ends: 94 [2023-02-18 07:12:40,225 INFO L226 Difference]: Without dead ends: 94 [2023-02-18 07:12:40,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:12:40,225 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:12:40,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 141 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:12:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-18 07:12:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-02-18 07:12:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 89 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2023-02-18 07:12:40,231 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2023-02-18 07:12:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:12:40,231 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2023-02-18 07:12:40,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:12:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2023-02-18 07:12:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-18 07:12:40,232 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:40,232 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:12:40,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 07:12:40,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:40,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2023-02-18 07:12:40,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:40,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286178465] [2023-02-18 07:12:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:12:40,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:40,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:40,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:40,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-18 07:12:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:12:40,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 07:12:40,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:40,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 07:12:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:12:40,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:12:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:12:40,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:40,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286178465] [2023-02-18 07:12:40,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286178465] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:12:40,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:12:40,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-18 07:12:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391935914] [2023-02-18 07:12:40,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:12:40,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:12:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:12:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:12:40,766 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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) [2023-02-18 07:12:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:12:41,911 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2023-02-18 07:12:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 07:12:41,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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 10 [2023-02-18 07:12:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:12:41,914 INFO L225 Difference]: With dead ends: 98 [2023-02-18 07:12:41,914 INFO L226 Difference]: Without dead ends: 98 [2023-02-18 07:12:41,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:12:41,916 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:12:41,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 301 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 07:12:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-18 07:12:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-18 07:12:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 95 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2023-02-18 07:12:41,926 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 10 [2023-02-18 07:12:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:12:41,927 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2023-02-18 07:12:41,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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) [2023-02-18 07:12:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2023-02-18 07:12:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 07:12:41,929 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:41,929 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:12:41,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-02-18 07:12:42,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:42,130 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:42,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:42,130 INFO L85 PathProgramCache]: Analyzing trace with hash -821954458, now seen corresponding path program 1 times [2023-02-18 07:12:42,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:42,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045878314] [2023-02-18 07:12:42,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:12:42,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:42,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:42,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:42,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-18 07:12:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:12:42,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:12:42,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:12:42,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:12:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:12:42,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:42,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045878314] [2023-02-18 07:12:42,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045878314] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:12:42,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:12:42,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 07:12:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285498402] [2023-02-18 07:12:42,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:12:42,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:12:42,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:12:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:12:42,309 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:12:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:12:42,482 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2023-02-18 07:12:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 07:12:42,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-02-18 07:12:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:12:42,484 INFO L225 Difference]: With dead ends: 118 [2023-02-18 07:12:42,484 INFO L226 Difference]: Without dead ends: 118 [2023-02-18 07:12:42,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:12:42,485 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 18 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:12:42,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 624 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:12:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-18 07:12:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-02-18 07:12:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 115 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2023-02-18 07:12:42,497 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 25 [2023-02-18 07:12:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:12:42,497 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2023-02-18 07:12:42,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:12:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2023-02-18 07:12:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-18 07:12:42,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:42,498 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:12:42,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-18 07:12:42,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:42,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash -34072841, now seen corresponding path program 2 times [2023-02-18 07:12:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:42,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164276076] [2023-02-18 07:12:42,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:12:42,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:42,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:42,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:42,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-18 07:12:42,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 07:12:42,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:12:42,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:12:42,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:42,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:12:42,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 07:12:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 07:12:42,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:12:42,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:42,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164276076] [2023-02-18 07:12:42,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164276076] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:12:42,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:12:42,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 07:12:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429918652] [2023-02-18 07:12:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:12:42,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:12:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:42,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:12:42,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:12:42,837 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:12:43,001 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2023-02-18 07:12:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:12:43,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2023-02-18 07:12:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:12:43,003 INFO L225 Difference]: With dead ends: 129 [2023-02-18 07:12:43,003 INFO L226 Difference]: Without dead ends: 129 [2023-02-18 07:12:43,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:12:43,003 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 55 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:12:43,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 91 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:12:43,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-18 07:12:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2023-02-18 07:12:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 110 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2023-02-18 07:12:43,007 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 45 [2023-02-18 07:12:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:12:43,007 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2023-02-18 07:12:43,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2023-02-18 07:12:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-18 07:12:43,008 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:43,008 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:12:43,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-18 07:12:43,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:43,215 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:43,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash -34072840, now seen corresponding path program 1 times [2023-02-18 07:12:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:43,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394421080] [2023-02-18 07:12:43,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:12:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:43,217 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:43,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-18 07:12:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:12:43,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 07:12:43,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:12:43,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:12:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:12:43,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:43,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394421080] [2023-02-18 07:12:43,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394421080] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:12:43,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:12:43,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-18 07:12:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401289639] [2023-02-18 07:12:43,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:12:43,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 07:12:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 07:12:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-02-18 07:12:43,583 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:12:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:12:43,963 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2023-02-18 07:12:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 07:12:43,964 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-02-18 07:12:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:12:43,964 INFO L225 Difference]: With dead ends: 121 [2023-02-18 07:12:43,964 INFO L226 Difference]: Without dead ends: 121 [2023-02-18 07:12:43,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-02-18 07:12:43,965 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 9 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:12:43,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1241 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:12:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-18 07:12:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-18 07:12:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 118 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2023-02-18 07:12:43,969 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 45 [2023-02-18 07:12:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:12:43,969 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2023-02-18 07:12:43,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:12:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2023-02-18 07:12:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-18 07:12:43,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:43,971 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:12:43,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-18 07:12:44,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:44,182 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2087093682, now seen corresponding path program 2 times [2023-02-18 07:12:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:44,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443123678] [2023-02-18 07:12:44,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:12:44,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:44,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:44,184 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:44,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-18 07:12:44,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 07:12:44,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:12:44,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 07:12:44,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:44,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:12:44,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 40 [2023-02-18 07:12:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 07:12:44,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:12:44,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:44,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443123678] [2023-02-18 07:12:44,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443123678] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:12:44,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:12:44,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 07:12:44,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750271236] [2023-02-18 07:12:44,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:12:44,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:12:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:44,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:12:44,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:12:44,391 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:12:44,965 INFO L93 Difference]: Finished difference Result 161 states and 167 transitions. [2023-02-18 07:12:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:12:44,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-18 07:12:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:12:44,966 INFO L225 Difference]: With dead ends: 161 [2023-02-18 07:12:44,966 INFO L226 Difference]: Without dead ends: 161 [2023-02-18 07:12:44,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:12:44,967 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 160 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 07:12:44,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 251 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 07:12:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-18 07:12:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2023-02-18 07:12:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 110 states have (on average 1.4) internal successors, (154), 136 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2023-02-18 07:12:44,971 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 53 [2023-02-18 07:12:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:12:44,971 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2023-02-18 07:12:44,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2023-02-18 07:12:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 07:12:44,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:44,972 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:12:44,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-18 07:12:45,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:45,177 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:45,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:45,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1633693263, now seen corresponding path program 1 times [2023-02-18 07:12:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:45,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391145552] [2023-02-18 07:12:45,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:12:45,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:45,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:45,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:45,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-18 07:12:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:12:45,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 07:12:45,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:45,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 07:12:45,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-18 07:12:45,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-18 07:12:45,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 07:12:45,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2023-02-18 07:12:45,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:12:45,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 07:12:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 07:12:45,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:12:45,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:45,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391145552] [2023-02-18 07:12:45,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391145552] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:12:45,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:12:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 07:12:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314413030] [2023-02-18 07:12:45,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:12:45,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:12:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:12:45,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:12:45,667 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:12:46,914 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2023-02-18 07:12:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 07:12:46,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2023-02-18 07:12:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:12:46,915 INFO L225 Difference]: With dead ends: 156 [2023-02-18 07:12:46,915 INFO L226 Difference]: Without dead ends: 156 [2023-02-18 07:12:46,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:12:46,916 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 270 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:12:46,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 224 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-18 07:12:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-18 07:12:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 133. [2023-02-18 07:12:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 130 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2023-02-18 07:12:46,919 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 56 [2023-02-18 07:12:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:12:46,919 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2023-02-18 07:12:46,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:12:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2023-02-18 07:12:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-18 07:12:46,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:12:46,920 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:12:46,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-18 07:12:47,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:47,125 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:12:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:12:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1213382400, now seen corresponding path program 1 times [2023-02-18 07:12:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:12:47,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135754430] [2023-02-18 07:12:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:12:47,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:12:47,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:12:47,127 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:12:47,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-18 07:12:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:12:47,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 07:12:47,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:12:47,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:12:47,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 35 [2023-02-18 07:12:47,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:12:47,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 07:12:47,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 07:12:47,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:12:47,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 144 [2023-02-18 07:12:47,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:12:47,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 106 [2023-02-18 07:12:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 07:12:59,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:12:59,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:12:59,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135754430] [2023-02-18 07:12:59,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135754430] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:12:59,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:12:59,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 07:12:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666535217] [2023-02-18 07:12:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:12:59,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:12:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:12:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:12:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:12:59,522 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:13:05,244 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2023-02-18 07:13:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 07:13:05,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-02-18 07:13:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:13:05,245 INFO L225 Difference]: With dead ends: 150 [2023-02-18 07:13:05,245 INFO L226 Difference]: Without dead ends: 150 [2023-02-18 07:13:05,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:13:05,246 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 174 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-02-18 07:13:05,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 283 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-02-18 07:13:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-18 07:13:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2023-02-18 07:13:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 134 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2023-02-18 07:13:05,250 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 59 [2023-02-18 07:13:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:13:05,250 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-02-18 07:13:05,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2023-02-18 07:13:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-18 07:13:05,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:13:05,254 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:13:05,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-18 07:13:05,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:05,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:13:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:13:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1430304375, now seen corresponding path program 1 times [2023-02-18 07:13:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:13:05,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83361039] [2023-02-18 07:13:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:13:05,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:05,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:13:05,460 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:13:05,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-18 07:13:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:13:05,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 07:13:05,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:13:05,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 07:13:05,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-18 07:13:05,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:05,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 79 [2023-02-18 07:13:05,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:05,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 56 [2023-02-18 07:13:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 07:13:05,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:13:05,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:13:05,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83361039] [2023-02-18 07:13:05,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83361039] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:13:05,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:13:05,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 07:13:05,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141544994] [2023-02-18 07:13:05,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:13:05,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:13:05,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:13:05,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:13:05,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:13:05,887 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:13:06,714 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2023-02-18 07:13:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 07:13:06,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2023-02-18 07:13:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:13:06,716 INFO L225 Difference]: With dead ends: 135 [2023-02-18 07:13:06,716 INFO L226 Difference]: Without dead ends: 135 [2023-02-18 07:13:06,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:13:06,716 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 68 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 07:13:06,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 271 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 07:13:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-18 07:13:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-02-18 07:13:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.309090909090909) internal successors, (144), 132 states have internal predecessors, (144), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2023-02-18 07:13:06,719 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 62 [2023-02-18 07:13:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:13:06,719 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2023-02-18 07:13:06,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2023-02-18 07:13:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-18 07:13:06,720 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:13:06,720 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:13:06,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-18 07:13:06,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:06,933 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:13:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:13:06,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1430304376, now seen corresponding path program 1 times [2023-02-18 07:13:06,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:13:06,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563926347] [2023-02-18 07:13:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:13:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:06,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:13:06,935 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:13:06,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-18 07:13:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:13:07,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:13:07,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:13:07,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-18 07:13:07,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 07:13:07,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-18 07:13:07,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-18 07:13:07,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-18 07:13:07,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-18 07:13:07,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-02-18 07:13:07,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-02-18 07:13:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 07:13:07,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:13:07,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:13:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563926347] [2023-02-18 07:13:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563926347] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:13:07,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:13:07,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 07:13:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105809944] [2023-02-18 07:13:07,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:13:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 07:13:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:13:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 07:13:07,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:13:07,348 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:13:07,931 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2023-02-18 07:13:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 07:13:07,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2023-02-18 07:13:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:13:07,932 INFO L225 Difference]: With dead ends: 134 [2023-02-18 07:13:07,932 INFO L226 Difference]: Without dead ends: 134 [2023-02-18 07:13:07,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:13:07,933 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 67 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 07:13:07,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 239 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 07:13:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-18 07:13:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-02-18 07:13:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.290909090909091) internal successors, (142), 131 states have internal predecessors, (142), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2023-02-18 07:13:07,936 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 62 [2023-02-18 07:13:07,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:13:07,936 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2023-02-18 07:13:07,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2023-02-18 07:13:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-18 07:13:07,936 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:13:07,937 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:13:07,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-18 07:13:08,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:08,150 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:13:08,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:13:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1064372062, now seen corresponding path program 1 times [2023-02-18 07:13:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:13:08,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384128785] [2023-02-18 07:13:08,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:13:08,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:08,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:13:08,151 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:13:08,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-18 07:13:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:13:08,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 07:13:08,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:13:08,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-18 07:13:08,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:08,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2023-02-18 07:13:08,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-18 07:13:08,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2023-02-18 07:13:08,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:08,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 91 [2023-02-18 07:13:08,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 32 [2023-02-18 07:13:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 07:13:08,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:13:08,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:13:08,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384128785] [2023-02-18 07:13:08,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384128785] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:13:08,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:13:08,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 07:13:08,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455026354] [2023-02-18 07:13:08,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:13:08,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:13:08,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:13:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:13:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:13:08,683 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:13:09,659 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2023-02-18 07:13:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 07:13:09,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2023-02-18 07:13:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:13:09,660 INFO L225 Difference]: With dead ends: 157 [2023-02-18 07:13:09,660 INFO L226 Difference]: Without dead ends: 157 [2023-02-18 07:13:09,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:13:09,661 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 149 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 07:13:09,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 213 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-18 07:13:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-18 07:13:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2023-02-18 07:13:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 119 states have (on average 1.319327731092437) internal successors, (157), 140 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2023-02-18 07:13:09,663 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 66 [2023-02-18 07:13:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:13:09,664 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2023-02-18 07:13:09,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2023-02-18 07:13:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-18 07:13:09,664 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:13:09,665 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:13:09,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-02-18 07:13:09,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:09,880 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:13:09,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:13:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1064372061, now seen corresponding path program 1 times [2023-02-18 07:13:09,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:13:09,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961225221] [2023-02-18 07:13:09,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:13:09,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:09,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:13:09,882 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:13:09,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-18 07:13:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:13:10,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 07:13:10,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:13:10,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-18 07:13:10,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:10,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 07:13:10,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 07:13:10,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-18 07:13:10,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-18 07:13:10,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2023-02-18 07:13:10,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-18 07:13:10,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:10,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 71 [2023-02-18 07:13:10,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-18 07:13:10,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-02-18 07:13:10,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-02-18 07:13:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 07:13:10,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:13:10,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:13:10,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961225221] [2023-02-18 07:13:10,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961225221] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:13:10,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:13:10,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 07:13:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512904201] [2023-02-18 07:13:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:13:10,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:13:10,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:13:10,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:13:10,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:13:10,494 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:13:11,158 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2023-02-18 07:13:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:13:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2023-02-18 07:13:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:13:11,160 INFO L225 Difference]: With dead ends: 155 [2023-02-18 07:13:11,160 INFO L226 Difference]: Without dead ends: 155 [2023-02-18 07:13:11,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-18 07:13:11,160 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 156 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 07:13:11,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 188 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 07:13:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-18 07:13:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2023-02-18 07:13:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 140 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2023-02-18 07:13:11,164 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 66 [2023-02-18 07:13:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:13:11,165 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2023-02-18 07:13:11,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:13:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2023-02-18 07:13:11,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-18 07:13:11,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:13:11,168 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2023-02-18 07:13:11,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-18 07:13:11,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:11,369 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-02-18 07:13:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:13:11,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1328353215, now seen corresponding path program 1 times [2023-02-18 07:13:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:13:11,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397142285] [2023-02-18 07:13:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:13:11,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:13:11,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:13:11,371 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:13:11,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-18 07:13:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:13:11,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:13:11,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:13:11,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-18 07:13:11,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:11,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2023-02-18 07:13:11,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-18 07:13:11,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2023-02-18 07:13:11,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:11,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 91 [2023-02-18 07:13:12,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:12,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 91 [2023-02-18 07:13:12,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 32 [2023-02-18 07:13:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-02-18 07:13:12,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:13:12,179 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_983) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1))) is different from false [2023-02-18 07:13:12,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_983) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2023-02-18 07:13:12,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_982 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_982))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_983)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2023-02-18 07:13:12,237 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_982 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_982))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_983)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2023-02-18 07:13:12,257 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_982 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_981 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_981))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_982)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_983)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))) is different from false [2023-02-18 07:13:12,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 07:13:12,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 76 [2023-02-18 07:13:12,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1625 treesize of output 1283 [2023-02-18 07:13:12,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1279 treesize of output 1041 [2023-02-18 07:13:12,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1041 treesize of output 782 [2023-02-18 07:13:12,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 782 treesize of output 754 [2023-02-18 07:14:56,347 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse466 (store |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base| (_ bv1 1))) (.cse10 (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|))) (let ((.cse0 (not .cse10)) (.cse39 (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse466 v_arrayElimCell_43)))))) (let ((.cse37 (or .cse10 .cse39)) (.cse451 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse154 (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (let ((.cse420 (and .cse451 .cse154)) (.cse413 (and .cse37 .cse39)) (.cse467 (or .cse0 .cse451))) (let ((.cse19 (or (and .cse467 .cse451) .cse10)) (.cse32 (or .cse413 .cse0)) (.cse421 (or .cse10 .cse420)) (.cse460 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_45) (_ bv1 1)))))) (.cse470 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (let ((.cse474 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse474 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse474 v_arrayElimCell_43) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse58 (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (select .cse466 v_arrayElimCell_44) (_ bv1 1)))) (.cse28 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (or (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_45) (_ bv1 1))))) (.cse156 (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_45) (_ bv1 1)))) .cse0)) (.cse269 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse459 (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse133 (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (_ bv1 1) (select .cse466 v_arrayElimCell_43)))) (.cse119 (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse466 v_arrayElimCell_44) (_ bv1 1))))) (.cse437 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse473 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse473 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse473 v_arrayElimCell_45) (_ bv1 1)))))) (.cse456 (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse472 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse472 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse472 v_arrayElimCell_45) (_ bv1 1)))))))) (let ((.cse75 (or .cse10 (and .cse437 .cse456))) (.cse125 (or .cse119 .cse10 .cse39)) (.cse458 (or .cse119 .cse39)) (.cse424 (or .cse119 .cse133 .cse10)) (.cse77 (or .cse10 (and .cse269 .cse459))) (.cse419 (or (and .cse28 .cse156) .cse10)) (.cse59 (or .cse58 .cse10)) (.cse71 (or .cse470 .cse10)) (.cse87 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse471 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse471 v_arrayElimCell_43) (_ bv1 1)))) (= (select .cse471 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse88 (or .cse470 .cse0)) (.cse453 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (let ((.cse469 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse469 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse469 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse450 (and (or .cse10 (and .cse421 .cse154)) .cse460)) (.cse15 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse441 (and .cse32 .cse37 .cse39)) (.cse2 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base|)))) (.cse408 (or .cse0 .cse39)) (.cse444 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_43) (_ bv1 1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse445 (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_43) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))) .cse10)) (.cse435 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse468 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse468 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse468 v_arrayElimCell_45) (_ bv1 1)))))) (.cse410 (or .cse0 .cse133)) (.cse423 (or .cse10 (and .cse467 .cse19))) (.cse26 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_45) (_ bv1 1)))))) (.cse29 (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse466 v_arrayElimCell_45) (_ bv1 1)))) (.cse409 (or .cse133 .cse10))) (let ((.cse411 (and .cse409 .cse39)) (.cse55 (or .cse29 .cse10)) (.cse440 (and .cse423 .cse26)) (.cse443 (or (and .cse410 .cse39) .cse10)) (.cse142 (let ((.cse465 (and .cse29 .cse0))) (and (or .cse465 .cse10) (or .cse465 .cse0)))) (.cse16 (or .cse435 .cse0)) (.cse161 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse464 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse464 v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse464 v_arrayElimCell_45) (_ bv1 1)))))) (.cse431 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse463 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse463 v_arrayElimCell_43) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse463 v_arrayElimCell_45) (_ bv1 1)))))) (.cse432 (or .cse10 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse462 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse462 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse462 v_arrayElimCell_45) (_ bv1 1))))))) (.cse22 (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))) .cse10)) (.cse150 (or (and .cse444 .cse445) .cse0)) (.cse442 (and .cse408 .cse39)) (.cse14 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse145 (or .cse441 .cse2)) (.cse24 (or .cse15 .cse10)) (.cse13 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_43) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse448 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_43) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse143 (or .cse450 .cse0)) (.cse45 (or .cse29 .cse2)) (.cse61 (or .cse453 .cse10)) (.cse72 (or (and (or (and .cse87 .cse88) .cse10) .cse71 .cse87 .cse88) .cse0)) (.cse73 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse461 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse461 v_arrayElimCell_43) (_ bv1 1)))) (= (select .cse461 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse461 v_arrayElimCell_45) (_ bv1 1))))))) (.cse122 (and .cse119 .cse59)) (.cse120 (or .cse119 .cse10)) (.cse30 (or .cse29 .cse0)) (.cse42 (or .cse29 .cse10 .cse2)) (.cse159 (or (and (or (and .cse419 .cse156) .cse10) .cse460) .cse0)) (.cse153 (or (and .cse77 .cse459) .cse10)) (.cse425 (and .cse458 .cse424)) (.cse426 (and .cse125 .cse458)) (.cse151 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse457 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse457 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse457 v_arrayElimCell_45) (_ bv1 1))))))) (.cse281 (or (and .cse75 .cse456) .cse10))) (let ((.cse79 (and .cse151 .cse281)) (.cse126 (or .cse119 .cse0 .cse39)) (.cse132 (or .cse119 .cse0 .cse133)) (.cse94 (or .cse426 .cse0)) (.cse134 (or .cse425 .cse0)) (.cse422 (or .cse269 .cse0)) (.cse47 (and .cse151 .cse153)) (.cse427 (and .cse42 .cse159)) (.cse158 (let ((.cse455 (and .cse29 .cse30))) (and (or .cse455 .cse10) (or .cse455 .cse0)))) (.cse83 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse454 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse454 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse454 v_arrayElimCell_43) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse454 v_arrayElimCell_45) (_ bv1 1)))))) (.cse51 (and .cse119 .cse120)) (.cse114 (or .cse0 .cse122)) (.cse69 (and .cse61 .cse71 .cse72 .cse73)) (.cse63 (or .cse453 .cse0)) (.cse64 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse452 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse452 v_arrayElimCell_43) (_ bv1 1)))) (= (select .cse452 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse141 (and .cse42 (or (and .cse45 .cse451) .cse0))) (.cse43 (or (and (or .cse450 .cse10) .cse143) .cse0)) (.cse146 (or (let ((.cse449 (or .cse0 (and .cse444 (or .cse448 .cse10))))) (and .cse145 (or .cse10 (and .cse24 .cse444 .cse13 .cse445 .cse449)) .cse449)) .cse0)) (.cse147 (or (let ((.cse447 (or .cse448 .cse0))) (and .cse447 (or .cse442 .cse2) (or .cse10 (and .cse444 .cse447 .cse14)))) .cse10)) (.cse148 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse446 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse446 v_arrayElimCell_43) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse446 v_arrayElimCell_45) (_ bv1 1))))))) (.cse149 (or .cse10 (and .cse22 .cse444 .cse13 .cse445 .cse150))) (.cse7 (or .cse0 (and .cse431 .cse432))) (.cse17 (or (and .cse16 .cse431 .cse161) .cse10)) (.cse123 (or .cse29 .cse0 .cse122)) (.cse56 (or .cse142 .cse10)) (.cse31 (or .cse10 (and .cse408 .cse443 .cse410 .cse39))) (.cse152 (or (and .cse408 (or .cse442 .cse10) .cse443 .cse410 (or (and .cse408 .cse443 .cse39) .cse10) .cse39) .cse0)) (.cse34 (or .cse29 .cse133)) (.cse38 (or .cse10 .cse441)) (.cse44 (or .cse440 .cse0)) (.cse46 (or .cse440 .cse10)) (.cse157 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse439 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse439 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse439 v_arrayElimCell_45) (_ bv1 1))))))) (.cse35 (and .cse30 .cse55)) (.cse412 (or .cse411 .cse0))) (let ((.cse33 (or .cse0 (and .cse32 .cse37 .cse412 (or (and .cse37 .cse412 .cse39) .cse10) .cse39))) (.cse36 (or .cse0 .cse35)) (.cse4 (or (let ((.cse436 (and (or .cse10 (let ((.cse438 (or .cse437 .cse0))) (and (or .cse10 (and .cse437 .cse438)) .cse438))) .cse157))) (and (or .cse436 .cse10) (or .cse436 .cse0))) .cse0)) (.cse41 (or (and .cse45 (or .cse0 (and .cse44 .cse46))) .cse0)) (.cse53 (and .cse31 .cse32 .cse152 .cse34 .cse37 .cse38 .cse39)) (.cse54 (and .cse10 .cse56)) (.cse124 (and (or .cse29 .cse58) .cse123)) (.cse5 (or (and .cse16 .cse17) .cse10)) (.cse18 (or .cse0 (let ((.cse434 (or .cse435 .cse10))) (let ((.cse433 (or (and .cse431 .cse434) .cse0))) (and .cse433 (or .cse10 (and .cse433 .cse431 .cse432 .cse434))))))) (.cse20 (or (and .cse7 .cse431 .cse432) .cse10)) (.cse40 (or (and (or .cse141 .cse10) .cse43 .cse145 .cse146 .cse147 .cse421 .cse148 .cse149 .cse150) .cse0)) (.cse68 (or (and .cse61 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse430 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse430 v_arrayElimCell_43) (_ bv1 1)))) (= (select .cse430 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse430 v_arrayElimCell_45) (_ bv1 1)))))) (or .cse0 (and (or (and .cse63 .cse64) .cse10) .cse63 .cse61 .cse64))) .cse10)) (.cse60 (or .cse10 .cse69)) (.cse113 (and .cse114 .cse123)) (.cse121 (or .cse51 .cse10)) (.cse52 (or .cse29 .cse119)) (.cse67 (or .cse10 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse429 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse429 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse429 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse429 v_arrayElimCell_45) (_ bv1 1))))))) (.cse81 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse428 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse428 v_arrayElimCell_43) (_ bv1 1)))) (= (select .cse428 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse428 v_arrayElimCell_45) (_ bv1 1)))))) (.cse80 (or .cse83 .cse10)) (.cse283 (or .cse158 .cse10)) (.cse160 (or .cse427 .cse0)) (.cse282 (or .cse427 .cse10)) (.cse48 (or .cse0 .cse47)) (.cse199 (or (and .cse269 .cse422) .cse10)) (.cse127 (or .cse29 .cse119 .cse133)) (.cse97 (or .cse426 .cse10)) (.cse128 (or (and .cse94 .cse134 (or .cse425 .cse10)) .cse0)) (.cse129 (or .cse0 (and .cse424 .cse126 .cse132))) (.cse49 (or .cse79 .cse0))) (and (or (let ((.cse1 (and .cse29 .cse30 (or (and .cse29 .cse30 .cse0) .cse10)))) (and (or .cse0 (let ((.cse27 (or .cse0 .cse28))) (let ((.cse21 (or .cse10 (and .cse28 .cse27)))) (let ((.cse3 (or (let ((.cse25 (and .cse26 (or .cse10 (and .cse27 .cse21))))) (and (or .cse25 .cse10) (or .cse25 .cse0))) .cse0))) (and (or .cse1 .cse2) .cse3 .cse4 (or (let ((.cse8 (or (and .cse22 .cse13) .cse0))) (let ((.cse6 (or (let ((.cse23 (or .cse0 (and .cse24 .cse13)))) (and .cse23 (or .cse10 (and .cse24 .cse22 .cse23 .cse13)))) .cse0)) (.cse9 (or .cse10 (and .cse22 .cse13 .cse8)))) (and .cse5 .cse6 .cse7 .cse3 (or (and .cse6 .cse8 .cse9) .cse10) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse11 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse11 v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse11 v_arrayElimCell_45) (_ bv1 1)))))) .cse8 (or (and .cse6 (or (let ((.cse12 (or .cse15 .cse0))) (and .cse12 (or .cse10 (and .cse13 .cse12 .cse14)))) .cse10) .cse16 .cse8 .cse9 .cse17) .cse10) .cse18 .cse19 .cse20 .cse9 .cse21))) .cse0)))))) (or .cse1 .cse10 .cse2))) .cse10) (or .cse0 (and (or (and .cse31 .cse32 .cse33 .cse34 (or .cse10 .cse35) .cse36 .cse37 .cse38 .cse39) .cse10 .cse2) .cse40 (or (and .cse41 .cse42) .cse10) (or (and .cse43 (or .cse10 (and (or .cse0 (and .cse44 .cse45 .cse46)) .cse42))) .cse0) (or .cse0 (and (or .cse10 .cse47) .cse48)))) (or (and .cse49 (or .cse10 (and (or .cse10 (let ((.cse50 (and (or .cse29 .cse51 .cse0) .cse52))) (and (or .cse50 .cse10) (or .cse50 .cse0))) .cse2) .cse49))) .cse0) (or (and (or .cse0 (and .cse31 .cse32 .cse33 .cse34 .cse37 .cse38 .cse39)) (or .cse10 .cse53) (or .cse54 .cse0) (or (and (or .cse0 (and .cse29 .cse30 .cse55)) (or (and .cse29 .cse30 .cse55 .cse10 .cse56) .cse10)) .cse0) (or (and .cse30 .cse55 .cse36 .cse56) .cse10)) .cse10 .cse2) (or (let ((.cse57 (or .cse29 (and (or .cse58 .cse0) .cse59) .cse10 .cse2))) (and (or (and .cse57 .cse4) .cse0) .cse57)) .cse10) (or .cse0 (let ((.cse65 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (let ((.cse92 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse92 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse92 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))))) (let ((.cse78 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse91 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse91 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse91 v_arrayElimCell_43) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse91 v_arrayElimCell_45) (_ bv1 1))))))) (.cse62 (or .cse65 .cse10))) (let ((.cse82 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse90 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse90 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse90 v_arrayElimCell_43) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse90 v_arrayElimCell_45) (_ bv1 1)))))) (.cse70 (let ((.cse86 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (let ((.cse89 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse89 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse89 v_arrayElimCell_43) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))))) (let ((.cse85 (or .cse86 .cse10))) (and .cse61 .cse71 (or (and .cse71 .cse85) .cse0) (or .cse0 (and (or (and (or .cse86 .cse0) .cse87) .cse10) .cse85 .cse87 .cse88)) .cse78 .cse62))))) (let ((.cse74 (or .cse70 .cse10)) (.cse84 (or .cse82 .cse10))) (and .cse60 (or (and (or (and .cse61 .cse62) .cse0) .cse61 (or .cse0 (and .cse63 .cse64 .cse62 (or (and .cse64 (or .cse65 .cse0)) .cse10))) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse66 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse66 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse66 v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse66 v_arrayElimCell_45) (_ bv1 1)))))) .cse62) .cse10) .cse67 .cse68 (or .cse0 (and (or .cse0 .cse69) (or .cse10 (and (or .cse70 .cse0) .cse61 .cse71 .cse72 .cse73)) .cse61 .cse71 .cse72 .cse74 .cse73)) .cse75 (or .cse10 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse76 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse76 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse76 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse76 v_arrayElimCell_45) (_ bv1 1)))))) .cse77 .cse78 (or (and (or .cse79 .cse10) .cse49) .cse0) .cse80 (or .cse0 (and .cse81 (or .cse10 (and .cse81 (or .cse82 .cse0))) (or .cse0 .cse83) .cse84)) (or (and .cse60 .cse74) .cse0) (or .cse0 (and .cse80 .cse84)))))))) (or .cse10 (let ((.cse136 (and .cse58 .cse119))) (let ((.cse137 (or .cse58 .cse10 .cse39)) (.cse138 (or .cse10 .cse136 .cse39)) (.cse135 (or .cse136 .cse39))) (let ((.cse139 (and .cse138 .cse135)) (.cse140 (and .cse137 .cse135))) (let ((.cse131 (or .cse58 .cse0 .cse39)) (.cse104 (or .cse140 .cse10)) (.cse106 (or .cse140 .cse0)) (.cse110 (or .cse10 .cse139)) (.cse112 (or .cse0 .cse139))) (let ((.cse108 (or (and .cse94 .cse110 .cse112) .cse0)) (.cse109 (or (and .cse138 .cse126 (or .cse0 .cse136 .cse39)) .cse0)) (.cse100 (and .cse104 .cse94 (or (and .cse131 .cse126 .cse137) .cse0) (or (and .cse104 .cse94 .cse106) .cse0) (or .cse29 .cse58 .cse39) .cse106)) (.cse111 (or .cse29 .cse136 .cse39)) (.cse130 (or .cse58 .cse133 .cse10))) (let ((.cse103 (or .cse0 (and .cse134 (or (and .cse130 .cse135) .cse10) .cse106))) (.cse102 (or .cse29 .cse58 .cse133)) (.cse105 (or (and .cse130 .cse131 .cse132) .cse0)) (.cse107 (and .cse108 .cse94 .cse109 .cse110 (or .cse100 .cse10) .cse111 .cse112))) (let ((.cse93 (or .cse107 .cse0)) (.cse101 (or .cse10 (and .cse103 .cse104 .cse94 .cse102 .cse105 .cse106))) (.cse95 (or (and .cse94 .cse97) .cse0)) (.cse96 (or .cse29 .cse119 .cse39)) (.cse99 (and .cse94 .cse127 .cse97 .cse128 .cse129)) (.cse98 (or .cse0 (and .cse125 .cse126)))) (and .cse93 (or .cse0 (and .cse94 .cse95 .cse96 .cse97 (or (and .cse94 .cse95 .cse96 .cse97 .cse98) .cse10) .cse98)) (or (and (or .cse0 .cse99) (or .cse100 .cse0) .cse101) .cse0) .cse102 (or .cse29 (and .cse103 .cse104 .cse94 .cse105 .cse106)) (or .cse107 .cse10) (or .cse0 (and .cse93 (or .cse10 (and .cse108 .cse94 .cse109 .cse110 .cse111 .cse101 .cse112)) (or (and .cse94 .cse95 .cse96 .cse97 (or .cse10 .cse99) .cse98) .cse0))) (or .cse10 (and (or .cse0 .cse113) (or .cse10 .cse113))) (or .cse0 (let ((.cse118 (and .cse119 .cse120 .cse59 (or .cse10 .cse122)))) (let ((.cse115 (or .cse0 (and .cse119 .cse120 .cse121))) (.cse116 (or .cse118 .cse0)) (.cse117 (or .cse118 .cse10))) (and .cse114 (or (and .cse115 .cse116 .cse117) .cse0) .cse115 .cse116 .cse117)))) .cse123 (or (and (or .cse124 .cse10) (or .cse124 .cse0)) .cse10))))))))) .cse2) (or (and (or (and (or .cse141 .cse0) .cse41 .cse42 (or .cse142 .cse10 .cse2)) .cse10) (or .cse10 .cse2 .cse53) (or .cse0 (let ((.cse144 (or .cse10 (and .cse42 .cse143)))) (and (or .cse0 (and .cse42 .cse143 .cse144)) (or .cse10 (and (or .cse54 .cse2) .cse42 .cse143 .cse144))))) (or (and .cse145 .cse146 .cse147 .cse148 .cse149 .cse150) .cse0) (or .cse0 (and (or (and .cse151 (or (and .cse31 .cse152 .cse34) .cse2) .cse153) .cse10) .cse48)) .cse154) .cse10) (or (let ((.cse338 (or .cse58 .cse2 .cse39)) (.cse386 (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse393 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse393 v_arrayElimCell_43) (_ bv1 1)) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse393 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))))))) (let ((.cse374 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse392 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse392 v_arrayElimCell_43) (_ bv1 1)) (= (_ bv1 1) (select .cse392 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse362 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse391 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse391 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse391 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse368 (or .cse119 .cse2 .cse39)) (.cse352 (and .cse338 .cse386)) (.cse173 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (let ((.cse390 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse390 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse390 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))))) (let ((.cse363 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse389 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse389 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse389 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse365 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse388 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse388 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse388 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse165 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64))) (let ((.cse387 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse387 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse387 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse168 (or .cse173 .cse10)) (.cse350 (or .cse10 .cse352)) (.cse371 (and .cse368 .cse386)) (.cse248 (or .cse362 .cse10)) (.cse249 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse385 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse385 v_arrayElimCell_43) (_ bv1 1)))) (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse385 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse367 (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse384 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse384 v_arrayElimCell_43) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse384 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|)))) (.cse339 (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse383 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse383 v_arrayElimCell_43) (_ bv1 1)))) (= (_ bv1 1) (select .cse383 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))))) (.cse348 (or .cse374 .cse10)) (.cse375 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse382 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse382 v_arrayElimCell_43) (_ bv1 1)) (= (_ bv1 1) (select .cse382 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))))) (let ((.cse303 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse265 (or .cse10 .cse375)) (.cse372 (and .cse367 .cse338 .cse339 .cse348)) (.cse238 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse381 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse381 v_arrayElimCell_43) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse381 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse240 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse380 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse380 v_arrayElimCell_43) (_ bv1 1)))) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (_ bv1 1) (select .cse380 v_arrayElimCell_44))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse373 (and .cse248 .cse249)) (.cse306 (or .cse371 .cse10)) (.cse370 (and .cse350 .cse367 .cse338 .cse339)) (.cse369 (and .cse168 .cse249)) (.cse359 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse379 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse379 v_arrayElimCell_43) (_ bv1 1)) (= (_ bv1 1) (select .cse379 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse317 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse378 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse378 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse378 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse328 (or .cse165 .cse10)) (.cse322 (or .cse365 .cse10)) (.cse340 (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse377 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse377 v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse377 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))))) (.cse205 (or .cse10 .cse363))) (let ((.cse366 (and .cse205 .cse249)) (.cse364 (and .cse322 .cse367 .cse340)) (.cse361 (and .cse367 .cse340 .cse328)) (.cse319 (or .cse317 .cse10)) (.cse313 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse376 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse376 v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse376 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))))) (.cse311 (or .cse10 .cse359)) (.cse344 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse174 (or .cse369 .cse0)) (.cse197 (or .cse0 .cse370)) (.cse343 (and .cse368 .cse367 .cse306 .cse339)) (.cse207 (or .cse373 .cse0)) (.cse200 (or (and .cse238 .cse240) .cse10)) (.cse333 (or .cse0 .cse372)) (.cse329 (and .cse368 .cse367 .cse265 .cse339)) (.cse302 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse301 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (.cse355 (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (or (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))))) .cse10)) (.cse213 (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (or (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))))) (.cse305 (or .cse0 .cse303))) (let ((.cse304 (or .cse10 (and .cse213 .cse305))) (.cse272 (and (or .cse0 (and (or .cse10 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (or (= (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)) v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) .cse302)) .cse301 .cse355)) (.cse326 (or .cse173 .cse0)) (.cse264 (or .cse0 .cse375)) (.cse331 (or .cse374 .cse0)) (.cse202 (or .cse373 .cse10)) (.cse263 (or .cse0 .cse329)) (.cse334 (or (and .cse200 .cse71 .cse173 .cse333) .cse10)) (.cse335 (or .cse10 .cse372)) (.cse208 (or (and .cse200 .cse61 .cse173 .cse207) .cse10)) (.cse307 (or .cse371 .cse0)) (.cse191 (or .cse10 .cse370)) (.cse170 (or .cse0 .cse343)) (.cse196 (or .cse10 (and .cse168 .cse173 .cse197))) (.cse166 (or (and .cse168 .cse173 .cse174) .cse10)) (.cse175 (or .cse369 .cse10)) (.cse214 (or .cse344 .cse0)) (.cse310 (and .cse368 .cse311 .cse339 .cse340)) (.cse336 (or .cse10 (and .cse240 .cse313))) (.cse360 (and .cse367 .cse340 .cse319)) (.cse171 (or .cse361 .cse0)) (.cse180 (or .cse10 (and .cse165 .cse173))) (.cse221 (or .cse10 (and .cse238 .cse313))) (.cse231 (or .cse0 .cse364)) (.cse206 (or .cse366 .cse0))) (let ((.cse228 (or (and .cse173 .cse205 .cse206) .cse10)) (.cse234 (or .cse366 .cse10)) (.cse316 (or .cse365 .cse0)) (.cse220 (or (and .cse165 .cse221 .cse173 .cse231) .cse10)) (.cse230 (or .cse10 .cse364)) (.cse239 (or .cse0 .cse363)) (.cse318 (or .cse362 .cse0)) (.cse164 (or .cse361 .cse10)) (.cse167 (or .cse10 (and .cse165 .cse171 .cse173 .cse180))) (.cse314 (or (and .cse61 .cse165 .cse336 .cse173 (or .cse360 .cse0)) .cse10)) (.cse315 (or .cse360 .cse10)) (.cse312 (or .cse0 .cse359)) (.cse273 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse358 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (_ bv1 1) (select .cse358 v_arrayElimCell_44))) (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse358 v_arrayElimCell_43) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse358 v_arrayElimCell_45) (_ bv1 1))))))) (.cse309 (or .cse310 .cse0)) (.cse215 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse357 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse357 v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse357 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse357 v_arrayElimCell_45) (_ bv1 1)))))) (.cse280 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse356 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse356 v_arrayElimCell_43) (_ bv1 1)))) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (_ bv1 1) (select .cse356 v_arrayElimCell_44))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse356 v_arrayElimCell_45) (_ bv1 1)))))) (.cse210 (or .cse10 (and .cse213 .cse214))) (.cse270 (or (and .cse301 .cse355 (or (and .cse301 .cse355) .cse0)) .cse10)) (.cse162 (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse354 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse354 v_arrayElimCell_43) (_ bv1 1)) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse354 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse354 v_arrayElimCell_45) (_ bv1 1)))))))) (.cse184 (or .cse0 (and .cse166 .cse168 .cse173 .cse174 .cse175))) (.cse192 (or (and .cse191 .cse168 .cse170 .cse173 .cse196 .cse197) .cse0)) (.cse193 (or .cse29 .cse58 .cse2 .cse39)) (.cse186 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse353 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse353 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse353 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse353 v_arrayElimCell_45) (_ bv1 1)))))) (.cse194 (or (let ((.cse351 (or .cse0 .cse352))) (and .cse350 .cse173 .cse351 (or (and .cse173 .cse351) .cse10) .cse307)) .cse0)) (.cse223 (and .cse200 .cse263 (or (and (or .cse10 (and .cse238 .cse240 .cse331 .cse87)) .cse264 .cse238 .cse240 .cse331 .cse87 .cse348) .cse0) .cse61 .cse71 .cse202 .cse173 (or .cse0 (and .cse200 .cse263 .cse71 .cse173 .cse205 .cse333 .cse334 .cse335)) .cse205 .cse206 .cse207 .cse333 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse349 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse349 v_arrayElimCell_43) (_ bv1 1)))) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (_ bv1 1) (select .cse349 v_arrayElimCell_44))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse349 v_arrayElimCell_45) (_ bv1 1)))))) .cse334 .cse335 .cse208)) (.cse189 (or .cse0 (and .cse168 (or (and .cse173 .cse326) .cse10) .cse173 .cse326))) (.cse258 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse347 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse347 v_arrayElimCell_43) (_ bv1 1)) (= (_ bv1 1) (select .cse347 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse347 v_arrayElimCell_45) (_ bv1 1)))))) (.cse299 (and .cse213 .cse304 (or .cse0 .cse122 .cse2) .cse305 (or .cse10 .cse272)))) (let ((.cse216 (or .cse299 .cse0)) (.cse292 (or .cse258 .cse10)) (.cse259 (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse346 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse346 v_arrayElimCell_43) (_ bv1 1)))) (= (_ bv1 1) (select .cse346 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse346 v_arrayElimCell_45) (_ bv1 1)))))))) (.cse260 (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse345 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse345 v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse345 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse345 v_arrayElimCell_45) (_ bv1 1)))))))) (.cse286 (and .cse162 .cse166 .cse191 .cse168 .cse170 .cse184 .cse192 .cse173 .cse174 .cse175 .cse193 .cse186 .cse194 .cse196 (or .cse223 .cse10) .cse189 .cse197)) (.cse300 (or .cse344 .cse10)) (.cse274 (and .cse210 .cse270 .cse213 .cse214)) (.cse172 (or (and .cse168 .cse170 .cse173) .cse10)) (.cse182 (or .cse10 .cse343)) (.cse279 (or (and .cse215 .cse280) .cse10)) (.cse253 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse342 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse342 v_arrayElimCell_43) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse342 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse342 v_arrayElimCell_45) (_ bv1 1)))))) (.cse227 (let ((.cse332 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse341 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse341 v_arrayElimCell_43) (_ bv1 1)) (= (_ bv1 1) (select .cse341 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))))) (let ((.cse330 (or .cse10 .cse332))) (and .cse200 .cse314 .cse263 .cse315 .cse61 .cse165 .cse71 .cse221 .cse173 (or .cse0 (and .cse330 .cse238 .cse240 .cse331 .cse312 (or .cse10 (and (or .cse0 .cse332) .cse240 .cse87 .cse313)) .cse87 .cse313)) .cse205 .cse273 .cse207 .cse333 .cse231 .cse334 .cse335 (or (let ((.cse337 (and .cse330 .cse338 .cse339 .cse340))) (and .cse200 .cse165 .cse71 .cse221 (or (and .cse165 .cse71 .cse336 .cse173 (or .cse337 .cse0)) .cse10) .cse173 .cse309 .cse333 (or .cse337 .cse10))) .cse0))))) (.cse266 (or .cse10 (and .cse263 .cse173 .cse205))) (.cse267 (or .cse10 .cse329)) (.cse176 (or (let ((.cse327 (or .cse165 .cse0))) (and .cse165 .cse173 .cse326 .cse327 .cse328 (or .cse10 (and .cse165 .cse173 .cse327)))) .cse0)) (.cse177 (or .cse0 (and .cse164 .cse165 .cse167 .cse168 .cse171 .cse173 .cse174 .cse180))) (.cse178 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse325 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse325 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse325 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse325 v_arrayElimCell_45) (_ bv1 1)))))) (.cse201 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse324 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse324 v_arrayElimCell_43) (_ bv1 1)))) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (_ bv1 1) (select .cse324 v_arrayElimCell_44))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse324 v_arrayElimCell_45) (_ bv1 1))))))) (.cse203 (or .cse0 (and .cse200 .cse61 .cse202 .cse173 .cse205 .cse206 .cse207 .cse208))) (.cse204 (or (and .cse64 .cse238 .cse239 .cse240 .cse248 (or .cse10 (and .cse64 .cse238 .cse240 .cse318)) .cse318) .cse0)) (.cse217 (or (and .cse220 .cse165 .cse221 .cse173 .cse230 .cse205 .cse206 .cse231) .cse0)) (.cse222 (or .cse0 (and (or (and .cse238 .cse239) .cse10) .cse238 .cse239 .cse205))) (.cse225 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse323 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse323 v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse323 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse323 v_arrayElimCell_45) (_ bv1 1))))))) (.cse229 (or (and .cse316 .cse322 (or (and .cse316 .cse238 .cse313) .cse10) .cse238 .cse239 .cse313) .cse0)) (.cse236 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse321 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse321 v_arrayElimCell_43) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse321 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse321 v_arrayElimCell_45) (_ bv1 1))))))) (.cse237 (or (and .cse173 .cse228 .cse205 .cse206 .cse234) .cse0))) (let ((.cse183 (or (and .cse217 .cse220 .cse165 .cse221 .cse222 .cse225 .cse173 .cse228 .cse229 .cse230 .cse205 .cse206 .cse236 .cse231 .cse237 .cse234) .cse10)) (.cse187 (or .cse10 (and .cse200 .cse217 .cse220 .cse61 .cse165 .cse221 .cse225 .cse201 .cse202 .cse173 .cse228 .cse203 .cse204 .cse229 .cse230 .cse205 .cse206 .cse207 .cse231 .cse234 .cse208))) (.cse211 (and .cse164 .cse165 .cse166 .cse167 .cse168 .cse171 .cse184 .cse173 .cse174 .cse175 (or .cse10 (and .cse200 .cse314 .cse315 .cse61 .cse165 .cse221 .cse202 .cse173 (or .cse0 (and .cse316 (or (and .cse64 .cse240 (or .cse317 .cse0) .cse313) .cse10) .cse64 .cse238 .cse240 .cse318 .cse313 .cse319)) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse320 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (_ bv1 1) (select .cse320 v_arrayElimCell_44))) (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse320 v_arrayElimCell_43) (_ bv1 1))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse320 v_arrayElimCell_45) (_ bv1 1)))))) .cse205 .cse206 .cse207 .cse231 (or .cse0 (and .cse200 .cse314 .cse315 .cse61 .cse165 .cse221 .cse173 .cse207 .cse231)) .cse208)) .cse186 .cse176 .cse177 .cse178 .cse189 .cse180)) (.cse181 (and .cse263 .cse220 .cse165 .cse221 .cse266 .cse173 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse308 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse308 v_arrayElimCell_43) (_ bv1 1))) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse308 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse308 v_arrayElimCell_45) (_ bv1 1)))))) (or .cse0 (and .cse263 .cse165 .cse221 .cse173 .cse205 (or (and .cse165 .cse221 .cse173 .cse309) .cse10) .cse309 (or .cse310 .cse10))) .cse230 .cse205 .cse206 .cse231 .cse267 (or .cse0 (and .cse311 .cse264 .cse238 .cse312 .cse313 (or (and .cse238 .cse312 .cse313) .cse10))))) (.cse195 (or .cse10 .cse227)) (.cse250 (or .cse10 (and .cse215 .cse186 .cse279 .cse253))) (.cse163 (or .cse0 (and .cse168 .cse170 .cse172 .cse173 .cse182))) (.cse179 (or (and .cse173 .cse306 (or (and .cse173 .cse307) .cse10) .cse307) .cse0)) (.cse251 (or .cse10 (and .cse215 .cse253))) (.cse185 (or (and .cse200 .cse61 .cse222 .cse201 .cse202 .cse173 .cse228 .cse203 .cse204 .cse205 .cse206 .cse207 .cse236 .cse237 .cse234 .cse208) .cse10)) (.cse252 (or (and .cse253 .cse280) .cse10)) (.cse262 (or .cse0 .cse274)) (.cse209 (or (and .cse81 .cse80) .cse0)) (.cse198 (or (and .cse300 .cse301 (or (and .cse300 .cse301) .cse0)) .cse10)) (.cse212 (or .cse0 (and (or (and .cse300 .cse301 (or .cse0 (and .cse302 (or .cse10 .cse303)))) .cse10) (or .cse51 .cse0 .cse2) .cse213 .cse304 .cse305))) (.cse278 (or .cse299 .cse10)) (.cse190 (or .cse286 .cse0)) (.cse261 (or .cse10 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse298 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse298 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse298 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse298 v_arrayElimCell_45) (_ bv1 1))))))) (.cse255 (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse297 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse297 v_arrayElimCell_43) (_ bv1 1)))) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse297 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse297 v_arrayElimCell_45) (_ bv1 1)))))))) (.cse257 (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse296 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse296 v_arrayElimCell_43) (_ bv1 1)) (= (_ bv1 1) (select .cse296 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse296 v_arrayElimCell_45) (_ bv1 1))))) .cse10)) (.cse169 (or .cse29 .cse119 .cse2 .cse39)) (.cse256 (and .cse292 .cse259 .cse193 .cse260)) (.cse287 (or .cse10 (and .cse210 .cse216 .cse77 .cse270 .cse213 .cse214)))) (and (or .cse10 (and (or .cse10 (and .cse42 (or (let ((.cse155 (and (or .cse29 .cse0 .cse2) .cse28))) (and (or .cse155 .cse0) (or .cse155 .cse10) .cse28)) .cse0) .cse156)) (or .cse0 (and .cse157 (or .cse124 .cse2))) (or (and (or (and .cse42 (or .cse158 .cse2) .cse159) .cse10) .cse160) .cse0) (or .cse124 .cse10 .cse2))) .cse60 (or .cse10 (and (or (and .cse5 .cse7 .cse18 .cse20) .cse0) (or .cse0 .cse161))) (or (let ((.cse188 (and .cse162 .cse164 .cse165 .cse166 .cse191 .cse167 .cse168 .cse170 .cse171 .cse192 .cse173 .cse174 .cse175 .cse193 .cse194 .cse176 .cse195 .cse177 .cse178 .cse196 .cse180 .cse197))) (and (or (and .cse162 .cse163 .cse164 .cse165 .cse166 .cse167 .cse168 .cse169 .cse170 .cse171 .cse172 .cse173 .cse174 .cse175 .cse176 .cse177 .cse178 .cse179 .cse180 (or .cse10 .cse181) .cse182) .cse0) .cse60 .cse183 .cse164 .cse165 .cse166 .cse167 .cse168 .cse171 .cse184 .cse173 .cse174 .cse185 .cse175 .cse186 (or (and .cse60 .cse187 .cse164 .cse165 .cse166 .cse167 .cse168 .cse171 .cse184 .cse173 (or .cse188 .cse0) .cse174 .cse175 .cse186 .cse176 .cse177 .cse178 .cse189 .cse180) .cse10) .cse176 .cse177 (or .cse188 .cse10) .cse178 .cse189 .cse180 .cse190)) .cse0) .cse183 .cse164 .cse198 .cse199 .cse165 (or .cse0 (and .cse166 .cse168 .cse184 .cse173 .cse174 .cse175 .cse186 (or (and .cse200 .cse61 .cse201 .cse202 .cse173 .cse203 .cse204 .cse205 .cse206 .cse207 .cse208) .cse10) .cse189)) .cse40 .cse68 .cse209 .cse166 .cse167 .cse210 .cse168 (or .cse10 .cse211) .cse212 (or (and .cse187 .cse164 .cse165 .cse68 .cse166 .cse167 .cse168 .cse171 .cse184 .cse173 .cse174 .cse175 (or .cse0 .cse211) .cse186 .cse176 .cse177 .cse178 .cse189 .cse180) .cse10) (or .cse10 (and .cse31 .cse32 .cse152 (or (and .cse30 .cse10) .cse0) .cse34 .cse0 .cse37 .cse38 .cse56 .cse39) .cse2) .cse171 (or (and .cse60 .cse166 .cse168 .cse184 .cse173 .cse174 .cse185 .cse175 .cse186 .cse189 .cse190) .cse10) .cse184 (or .cse0 (and .cse198 .cse210 .cse213 .cse214)) .cse215 .cse216 (or (let ((.cse246 (and .cse71 .cse248 .cse249))) (let ((.cse233 (or .cse0 .cse246))) (let ((.cse218 (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse247 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse247 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse247 v_arrayElimCell_43) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse247 v_arrayElimCell_45) (_ bv1 1)))))))) (.cse219 (or .cse10 .cse246)) (.cse224 (or (and .cse200 .cse71 .cse173 .cse233) .cse10)) (.cse226 (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse245 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (_ bv1 1) (select .cse245 v_arrayElimCell_44))) (= (select .cse245 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse245 v_arrayElimCell_45) (_ bv1 1))))) (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|)))) (.cse232 (or (let ((.cse241 (and (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse243 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (select .cse243 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= (select .cse243 v_arrayElimCell_43) (_ bv1 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|))) (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse244 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (_ bv1 1) (select .cse244 v_arrayElimCell_44))) (= (select .cse244 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1)))))) (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|)))))) (let ((.cse242 (or .cse0 .cse241))) (and .cse238 .cse239 .cse240 (or .cse241 .cse10) .cse87 (or (and .cse238 .cse240 .cse87 .cse242) .cse10) .cse242))) .cse0)) (.cse235 (or .cse0 (and .cse200 .cse61 .cse71 .cse202 .cse173 .cse205 .cse206 .cse207 .cse208)))) (and .cse200 .cse217 (or .cse0 .cse181) .cse218 .cse219 .cse220 .cse61 .cse165 .cse71 .cse221 .cse222 (or .cse223 .cse0) .cse224 .cse225 .cse202 .cse226 (or (and .cse200 .cse217 .cse218 .cse219 .cse220 .cse61 .cse165 .cse71 .cse221 .cse224 .cse225 .cse202 (or .cse0 .cse227) .cse226 .cse173 .cse228 .cse229 .cse230 .cse205 .cse206 .cse207 .cse231 .cse232 .cse233 .cse234 .cse235 .cse208) .cse10) .cse173 .cse228 .cse229 .cse230 .cse205 .cse206 .cse207 .cse236 .cse231 .cse232 .cse237 .cse195 .cse233 .cse234 .cse235 .cse208)))) .cse0) .cse173 (or .cse0 (and .cse215 .cse250 .cse251 .cse252 .cse186 .cse253)) .cse250 (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse254 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse254 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse254 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse254 v_arrayElimCell_45) (_ bv1 1))))) .cse10) .cse77 (or (and .cse255 (or .cse256 .cse0) .cse257 (or .cse258 .cse0) .cse259 .cse193 .cse260 .cse261) .cse10) .cse262 (or .cse0 (and .cse162 .cse163 .cse166 .cse168 .cse169 .cse170 .cse172 .cse184 .cse173 .cse174 .cse175 .cse186 .cse189 .cse179 (or (and .cse263 (or (and (or (and .cse264 .cse238) .cse10) .cse264 .cse265 .cse238) .cse0) .cse266 (or (and .cse263 .cse266 .cse173 .cse205 .cse267) .cse0) .cse173 .cse228 .cse205 .cse206 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64))) (let ((.cse268 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse268 v_arrayElimCell_43) (_ bv1 1)))) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse268 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (forall ((v_arrayElimCell_45 (_ BitVec 64))) (= (select .cse268 v_arrayElimCell_45) (_ bv1 1)))))) .cse267 .cse234) .cse10) .cse182)) (or (and (or (and .cse269 (or .cse113 .cse2)) .cse0) (or .cse10 .cse113 .cse2)) .cse10) .cse174 .cse251 .cse270 (or (and .cse252 .cse186 .cse253) .cse10) .cse185 .cse213 .cse175 (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse271 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse271 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse271 v_arrayElimCell_45) (_ bv1 1))))) .cse0) .cse252 (or .cse0 .cse272) .cse273 (or .cse10 .cse274) .cse186 (or .cse10 (and .cse222 .cse173 .cse228 .cse205 .cse206 .cse236 .cse237 .cse234)) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse275 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse275 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse275 v_arrayElimCell_45) (_ bv1 1))))))) .cse176 (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse276 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse276 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse276 v_arrayElimCell_45) (_ bv1 1))))) (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse277 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= (_ bv1 1) (select .cse277 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse277 v_arrayElimCell_45) (_ bv1 1))))))) .cse10) .cse214 .cse177 .cse278 (or .cse0 (and .cse215 .cse279 .cse253 .cse280)) (or (and (or (and .cse151 .cse281 (or (and .cse34 (or .cse29 (and .cse31 .cse152))) .cse2)) .cse10) .cse49) .cse0) (or .cse0 (and .cse164 .cse165 .cse166 .cse167 .cse168 .cse171 .cse184 .cse173 .cse174 .cse175 .cse186 .cse176 .cse177 .cse178 (or .cse10 (and .cse217 .cse220 .cse165 .cse221 .cse225 .cse173 .cse228 .cse229 .cse230 .cse205 .cse206 .cse231 .cse234)) .cse189 .cse180)) (or (and .cse199 .cse210 .cse262 .cse270 .cse213 .cse214) .cse10) .cse253 (or .cse0 (and (or .cse0 (and .cse282 .cse151 .cse159 .cse281)) (or (and .cse282 (or (and .cse283 (or (let ((.cse284 (or .cse51 .cse0))) (and (or .cse119 .cse0) .cse284 (or .cse0 (and .cse284 .cse121)) .cse121)) .cse29) .cse52) .cse2) .cse151 .cse159 .cse281) .cse10))) (or (and .cse67 .cse209 .cse81 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse285 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse285 v_arrayElimCell_43) (_ bv1 1)))) (= (select .cse285 |c_ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse285 v_arrayElimCell_45) (_ bv1 1))))) .cse80) .cse10) .cse178 (or .cse286 .cse10) (or (and .cse198 .cse210 .cse212 .cse216 .cse77 .cse270 .cse213 .cse214 .cse278 .cse287) .cse0) .cse189 .cse180 .cse190 (or .cse0 (and .cse255 (or .cse10 (and .cse255 .cse260 .cse261)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse288 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse288 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse288 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse288 v_arrayElimCell_45) (_ bv1 1))))) .cse10) .cse257 .cse169 (or .cse10 (and .cse255 .cse257 .cse259 .cse193)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse289 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse289 v_arrayElimCell_43) (_ bv1 1)) (= (_ bv1 1) (select .cse289 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse289 v_arrayElimCell_45) (_ bv1 1))))) .cse10) (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse290 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse290 v_arrayElimCell_43) (_ bv1 1)))) (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse290 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse290 v_arrayElimCell_45) (_ bv1 1))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse291 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse291 v_arrayElimCell_43) (_ bv1 1)))) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (= (_ bv1 1) (select .cse291 v_arrayElimCell_44))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse291 v_arrayElimCell_45) (_ bv1 1))))) .cse292 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64))) (let ((.cse293 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (forall ((v_arrayElimCell_43 (_ BitVec 64))) (= (select .cse293 v_arrayElimCell_43) (_ bv1 1))) (forall ((v_arrayElimCell_44 (_ BitVec 64))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse293 v_arrayElimCell_44)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse293 v_arrayElimCell_45) (_ bv1 1)))))) .cse0) (or (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse294 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_43 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse294 v_arrayElimCell_43) (_ bv1 1)) (= |v_ULTIMATE.start_main_#t~malloc123#1.base_7| |c_ULTIMATE.start_main_~argv~0#1.base|) (= (_ bv1 1) (select .cse294 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse294 v_arrayElimCell_45) (_ bv1 1))))) .cse10) .cse259 .cse193 .cse260 (or (and .cse255 .cse257 .cse169 (or .cse10 (forall ((|v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ BitVec 64)) (v_arrayElimCell_43 (_ BitVec 64)) (v_arrayElimCell_45 (_ BitVec 64)) (v_arrayElimCell_44 (_ BitVec 64))) (let ((.cse295 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7| (_ bv1 1)))) (or (= v_arrayElimCell_44 |c_ULTIMATE.start_main_~argv~0#1.base|) (= (select .cse295 v_arrayElimCell_43) (_ bv1 1)) (= (_ bv1 1) (select .cse295 v_arrayElimCell_44)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc123#1.base_7|) (_ bv0 1))) (= (select .cse295 v_arrayElimCell_45) (_ bv1 1)))))) .cse259 .cse193 .cse260 (or .cse256 .cse10)) .cse0))) .cse287)))))))))) .cse0) (or (let ((.cse417 (or (and (or (and .cse423 .cse26 .cse143) .cse10) .cse143) .cse0)) (.cse418 (or (and .cse157 .cse48 (or (and .cse199 .cse422) .cse10)) .cse10))) (let ((.cse394 (or .cse0 (and .cse282 .cse159))) (.cse414 (or (and .cse282 .cse419 .cse151 .cse159 (or (and .cse417 .cse418 (or (and (or .cse0 .cse420) .cse421) .cse10) .cse48) .cse10) .cse281) .cse0)) (.cse415 (or (and .cse417 (or (and .cse418 .cse48) .cse0)) .cse10)) (.cse416 (or (and .cse282 .cse160) .cse10))) (and (or (and .cse42 .cse394 (or (and .cse55 (or (let ((.cse400 (or .cse413 .cse10))) (let ((.cse398 (or .cse29 .cse39)) (.cse399 (or (and .cse408 .cse37) .cse0)) (.cse401 (or .cse0 (and .cse32 .cse400)))) (let ((.cse405 (and .cse32 .cse398 .cse399 .cse400 .cse401)) (.cse403 (or .cse0 (and .cse32 (or .cse411 .cse10) .cse412))) (.cse404 (or (and .cse408 .cse409 .cse410) .cse0))) (let ((.cse406 (and .cse403 .cse32 .cse34 .cse400 .cse404)) (.cse395 (and .cse32 (or .cse10 .cse405) .cse398 .cse399 .cse400 .cse401))) (let ((.cse396 (or .cse395 .cse0)) (.cse402 (or .cse10 .cse406))) (and (or .cse395 .cse10) (or .cse0 (let ((.cse397 (and .cse32 .cse398 .cse399 .cse400 .cse401 .cse402))) (and .cse396 (or .cse397 .cse0) (or .cse397 .cse10)))) (or .cse29 (and .cse403 .cse32 .cse400 .cse404)) .cse396 .cse34 (or .cse0 (and (or .cse0 .cse405) .cse402 (or .cse0 .cse406))) .cse30 .cse0 .cse283 (or (let ((.cse407 (and .cse30 .cse0))) (and (or .cse407 .cse0) (or .cse407 .cse10))) .cse10))))))) .cse10)) .cse2) .cse414 .cse415 .cse416 .cse49) .cse10) (or .cse0 (and .cse42 .cse394 .cse414 .cse415 .cse416 .cse49))))) .cse0) (or (and (or (and .cse151 (or (and .cse127 (or .cse29 (and .cse94 .cse97 .cse128 .cse129))) .cse2) .cse281) .cse10) .cse49) .cse0))))))))))) is different from true