./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/eqn4.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/eqn4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30192b5b0c1eb564e0de6a5c7a5fdad0c55c7aa4 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/eqn4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30192b5b0c1eb564e0de6a5c7a5fdad0c55c7aa4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 11:40:50,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 11:40:50,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 11:40:50,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 11:40:50,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 11:40:50,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 11:40:50,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 11:40:50,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 11:40:50,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 11:40:50,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 11:40:50,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 11:40:50,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 11:40:50,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 11:40:50,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 11:40:50,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 11:40:50,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 11:40:50,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 11:40:50,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 11:40:50,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 11:40:50,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 11:40:50,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 11:40:50,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 11:40:50,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 11:40:50,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 11:40:50,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 11:40:50,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 11:40:50,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 11:40:50,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 11:40:50,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 11:40:50,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 11:40:50,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 11:40:50,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 11:40:50,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 11:40:50,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 11:40:50,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 11:40:50,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 11:40:50,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 11:40:50,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 11:40:50,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 11:40:50,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 11:40:50,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 11:40:50,610 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 11:40:50,650 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 11:40:50,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 11:40:50,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 11:40:50,652 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 11:40:50,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 11:40:50,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 11:40:50,654 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 11:40:50,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 11:40:50,654 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 11:40:50,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 11:40:50,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 11:40:50,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 11:40:50,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 11:40:50,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 11:40:50,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 11:40:50,656 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 11:40:50,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 11:40:50,656 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 11:40:50,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 11:40:50,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 11:40:50,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 11:40:50,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 11:40:50,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 11:40:50,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 11:40:50,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 11:40:50,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 11:40:50,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 11:40:50,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 11:40:50,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 11:40:50,659 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 11:40:50,659 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30192b5b0c1eb564e0de6a5c7a5fdad0c55c7aa4 [2021-09-13 11:40:50,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 11:40:51,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 11:40:51,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 11:40:51,033 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 11:40:51,033 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 11:40:51,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/eqn4.c [2021-09-13 11:40:51,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae19eda9c/8d5f88d69a63402ca9521068581ef5a0/FLAGc683eac67 [2021-09-13 11:40:51,540 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 11:40:51,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/eqn4.c [2021-09-13 11:40:51,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae19eda9c/8d5f88d69a63402ca9521068581ef5a0/FLAGc683eac67 [2021-09-13 11:40:51,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae19eda9c/8d5f88d69a63402ca9521068581ef5a0 [2021-09-13 11:40:51,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 11:40:51,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 11:40:51,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 11:40:51,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 11:40:51,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 11:40:51,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:40:51" (1/1) ... [2021-09-13 11:40:51,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c831f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:51, skipping insertion in model container [2021-09-13 11:40:51,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:40:51" (1/1) ... [2021-09-13 11:40:51,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 11:40:51,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 11:40:52,071 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/eqn4.c[587,600] [2021-09-13 11:40:52,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 11:40:52,096 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 11:40:52,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/eqn4.c[587,600] [2021-09-13 11:40:52,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 11:40:52,176 INFO L208 MainTranslator]: Completed translation [2021-09-13 11:40:52,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52 WrapperNode [2021-09-13 11:40:52,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 11:40:52,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 11:40:52,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 11:40:52,179 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 11:40:52,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 11:40:52,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 11:40:52,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 11:40:52,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 11:40:52,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 11:40:52,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 11:40:52,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 11:40:52,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 11:40:52,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (1/1) ... [2021-09-13 11:40:52,273 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 11:40:52,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:40:52,298 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) [2021-09-13 11:40:52,320 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 [2021-09-13 11:40:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 11:40:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 11:40:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-13 11:40:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-09-13 11:40:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 11:40:52,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 11:40:52,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-09-13 11:40:52,729 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 11:40:52,729 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-09-13 11:40:52,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:40:52 BoogieIcfgContainer [2021-09-13 11:40:52,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 11:40:52,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 11:40:52,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 11:40:52,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 11:40:52,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 11:40:51" (1/3) ... [2021-09-13 11:40:52,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47596cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:40:52, skipping insertion in model container [2021-09-13 11:40:52,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:40:52" (2/3) ... [2021-09-13 11:40:52,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47596cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:40:52, skipping insertion in model container [2021-09-13 11:40:52,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:40:52" (3/3) ... [2021-09-13 11:40:52,739 INFO L111 eAbstractionObserver]: Analyzing ICFG eqn4.c [2021-09-13 11:40:52,743 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 11:40:52,744 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 11:40:52,805 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 11:40:52,812 INFO L339 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=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 11:40:52,813 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 11:40:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 11:40:52,845 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:40:52,845 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:40:52,847 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:40:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:40:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2021-09-13 11:40:52,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:40:52,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289543903] [2021-09-13 11:40:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:52,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:40:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:53,038 INFO L281 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {24#true} is VALID [2021-09-13 11:40:53,038 INFO L281 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {24#true} is VALID [2021-09-13 11:40:53,039 INFO L281 TraceCheckUtils]: 2: Hoare triple {24#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {24#true} is VALID [2021-09-13 11:40:53,040 INFO L281 TraceCheckUtils]: 3: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2021-09-13 11:40:53,040 INFO L281 TraceCheckUtils]: 4: Hoare triple {25#false} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {25#false} is VALID [2021-09-13 11:40:53,041 INFO L281 TraceCheckUtils]: 5: Hoare triple {25#false} assume !(main_~i~0 < ~N~0); {25#false} is VALID [2021-09-13 11:40:53,041 INFO L281 TraceCheckUtils]: 6: Hoare triple {25#false} main_~i~0 := 1; {25#false} is VALID [2021-09-13 11:40:53,042 INFO L281 TraceCheckUtils]: 7: Hoare triple {25#false} assume !(main_~i~0 < ~N~0); {25#false} is VALID [2021-09-13 11:40:53,042 INFO L281 TraceCheckUtils]: 8: Hoare triple {25#false} main_~i~0 := 0; {25#false} is VALID [2021-09-13 11:40:53,042 INFO L281 TraceCheckUtils]: 9: Hoare triple {25#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {25#false} is VALID [2021-09-13 11:40:53,043 INFO L281 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond; {25#false} is VALID [2021-09-13 11:40:53,043 INFO L281 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2021-09-13 11:40:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:40:53,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:40:53,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289543903] [2021-09-13 11:40:53,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289543903] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 11:40:53,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 11:40:53,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 11:40:53,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54285737] [2021-09-13 11:40:53,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-09-13 11:40:53,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:40:53,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:53,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:53,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 11:40:53,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:40:53,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 11:40:53,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 11:40:53,107 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:53,190 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-09-13 11:40:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 11:40:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-09-13 11:40:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:40:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2021-09-13 11:40:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2021-09-13 11:40:53,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2021-09-13 11:40:53,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:53,298 INFO L225 Difference]: With dead ends: 38 [2021-09-13 11:40:53,299 INFO L226 Difference]: Without dead ends: 17 [2021-09-13 11:40:53,301 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 11:40:53,305 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.56ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.57ms IncrementalHoareTripleChecker+Time [2021-09-13 11:40:53,306 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.56ms Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 31.57ms Time] [2021-09-13 11:40:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-09-13 11:40:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-09-13 11:40:53,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:40:53,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) [2021-09-13 11:40:53,337 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) [2021-09-13 11:40:53,339 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) [2021-09-13 11:40:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:53,341 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-09-13 11:40:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 11:40:53,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:53,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:53,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) Second operand 17 states. [2021-09-13 11:40:53,343 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) Second operand 17 states. [2021-09-13 11:40:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:53,351 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-09-13 11:40:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 11:40:53,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:53,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:53,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:40:53,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:40:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) [2021-09-13 11:40:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-09-13 11:40:53,358 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2021-09-13 11:40:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:40:53,358 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-09-13 11:40:53,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 11:40:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 11:40:53,360 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:40:53,361 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:40:53,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 11:40:53,362 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:40:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:40:53,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2021-09-13 11:40:53,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:40:53,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658186074] [2021-09-13 11:40:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:53,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:40:53,403 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:40:53,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719731549] [2021-09-13 11:40:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:53,404 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:40:53,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:40:53,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:40:53,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 11:40:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:53,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 11:40:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:53,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:40:53,601 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-09-13 11:40:53,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-09-13 11:40:53,894 INFO L281 TraceCheckUtils]: 0: Hoare triple {128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {128#true} is VALID [2021-09-13 11:40:53,894 INFO L281 TraceCheckUtils]: 1: Hoare triple {128#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {128#true} is VALID [2021-09-13 11:40:53,895 INFO L281 TraceCheckUtils]: 2: Hoare triple {128#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {128#true} is VALID [2021-09-13 11:40:53,895 INFO L281 TraceCheckUtils]: 3: Hoare triple {128#true} assume !(0 == assume_abort_if_not_~cond); {128#true} is VALID [2021-09-13 11:40:53,896 INFO L281 TraceCheckUtils]: 4: Hoare triple {128#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {145#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:40:53,897 INFO L281 TraceCheckUtils]: 5: Hoare triple {145#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} assume !(main_~i~0 < ~N~0); {145#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:40:53,897 INFO L281 TraceCheckUtils]: 6: Hoare triple {145#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_~i~0 := 1; {145#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:40:53,898 INFO L281 TraceCheckUtils]: 7: Hoare triple {145#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} assume !(main_~i~0 < ~N~0); {145#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:40:53,898 INFO L281 TraceCheckUtils]: 8: Hoare triple {145#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_~i~0 := 0; {158#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 0))} is VALID [2021-09-13 11:40:53,899 INFO L281 TraceCheckUtils]: 9: Hoare triple {158#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {162#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 11:40:53,900 INFO L281 TraceCheckUtils]: 10: Hoare triple {162#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {129#false} is VALID [2021-09-13 11:40:53,900 INFO L281 TraceCheckUtils]: 11: Hoare triple {129#false} assume !false; {129#false} is VALID [2021-09-13 11:40:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:40:53,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 11:40:53,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:40:53,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658186074] [2021-09-13 11:40:53,902 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:40:53,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719731549] [2021-09-13 11:40:53,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719731549] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 11:40:53,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 11:40:53,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 11:40:53,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984273596] [2021-09-13 11:40:53,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-09-13 11:40:53,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:40:53,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:53,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:53,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 11:40:53,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:40:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 11:40:53,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 11:40:53,925 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:54,137 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-09-13 11:40:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 11:40:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-09-13 11:40:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:40:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2021-09-13 11:40:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2021-09-13 11:40:54,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2021-09-13 11:40:54,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:54,185 INFO L225 Difference]: With dead ends: 34 [2021-09-13 11:40:54,185 INFO L226 Difference]: Without dead ends: 32 [2021-09-13 11:40:54,186 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 45.18ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-13 11:40:54,187 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.35ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.26ms IncrementalHoareTripleChecker+Time [2021-09-13 11:40:54,187 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 78 Unknown, 0 Unchecked, 2.35ms Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 85.26ms Time] [2021-09-13 11:40:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-09-13 11:40:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2021-09-13 11:40:54,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:40:54,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,196 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,197 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:54,198 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-09-13 11:40:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-09-13 11:40:54,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:54,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:54,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2021-09-13 11:40:54,200 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2021-09-13 11:40:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:54,202 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-09-13 11:40:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-09-13 11:40:54,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:54,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:54,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:40:54,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:40:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-09-13 11:40:54,204 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2021-09-13 11:40:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:40:54,205 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-09-13 11:40:54,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-09-13 11:40:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 11:40:54,206 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:40:54,206 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:40:54,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 11:40:54,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:40:54,418 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:40:54,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:40:54,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1755224028, now seen corresponding path program 1 times [2021-09-13 11:40:54,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:40:54,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266537733] [2021-09-13 11:40:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:54,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:40:54,434 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:40:54,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005385210] [2021-09-13 11:40:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:54,435 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:40:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:40:54,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:40:54,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 11:40:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:54,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 11:40:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:54,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:40:54,641 INFO L281 TraceCheckUtils]: 0: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {307#true} is VALID [2021-09-13 11:40:54,641 INFO L281 TraceCheckUtils]: 1: Hoare triple {307#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {307#true} is VALID [2021-09-13 11:40:54,642 INFO L281 TraceCheckUtils]: 2: Hoare triple {307#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {307#true} is VALID [2021-09-13 11:40:54,642 INFO L281 TraceCheckUtils]: 3: Hoare triple {307#true} assume !(0 == assume_abort_if_not_~cond); {307#true} is VALID [2021-09-13 11:40:54,643 INFO L281 TraceCheckUtils]: 4: Hoare triple {307#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {324#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:40:54,644 INFO L281 TraceCheckUtils]: 5: Hoare triple {324#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {328#(<= ~N~0 1)} is VALID [2021-09-13 11:40:54,644 INFO L281 TraceCheckUtils]: 6: Hoare triple {328#(<= ~N~0 1)} main_~i~0 := 1; {332#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2021-09-13 11:40:54,646 INFO L281 TraceCheckUtils]: 7: Hoare triple {332#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {308#false} is VALID [2021-09-13 11:40:54,646 INFO L281 TraceCheckUtils]: 8: Hoare triple {308#false} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {308#false} is VALID [2021-09-13 11:40:54,646 INFO L281 TraceCheckUtils]: 9: Hoare triple {308#false} assume !(main_~i~0 < ~N~0); {308#false} is VALID [2021-09-13 11:40:54,646 INFO L281 TraceCheckUtils]: 10: Hoare triple {308#false} main_~i~0 := 0; {308#false} is VALID [2021-09-13 11:40:54,647 INFO L281 TraceCheckUtils]: 11: Hoare triple {308#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {308#false} is VALID [2021-09-13 11:40:54,647 INFO L281 TraceCheckUtils]: 12: Hoare triple {308#false} assume 0 == __VERIFIER_assert_~cond; {308#false} is VALID [2021-09-13 11:40:54,647 INFO L281 TraceCheckUtils]: 13: Hoare triple {308#false} assume !false; {308#false} is VALID [2021-09-13 11:40:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:40:54,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 11:40:54,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:40:54,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266537733] [2021-09-13 11:40:54,648 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:40:54,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005385210] [2021-09-13 11:40:54,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005385210] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 11:40:54,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 11:40:54,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 11:40:54,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575346554] [2021-09-13 11:40:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 11:40:54,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:40:54,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:54,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 11:40:54,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:40:54,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 11:40:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 11:40:54,665 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:54,906 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-09-13 11:40:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 11:40:54,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 11:40:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:40:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2021-09-13 11:40:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2021-09-13 11:40:54,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2021-09-13 11:40:54,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:54,958 INFO L225 Difference]: With dead ends: 49 [2021-09-13 11:40:54,958 INFO L226 Difference]: Without dead ends: 40 [2021-09-13 11:40:54,959 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.29ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-13 11:40:54,959 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 92.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.80ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 94.90ms IncrementalHoareTripleChecker+Time [2021-09-13 11:40:54,960 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 1.80ms Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 94.90ms Time] [2021-09-13 11:40:54,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-09-13 11:40:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2021-09-13 11:40:54,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:40:54,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,969 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,970 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:54,977 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-09-13 11:40:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-09-13 11:40:54,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:54,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:54,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2021-09-13 11:40:54,979 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2021-09-13 11:40:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:54,981 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-09-13 11:40:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-09-13 11:40:54,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:54,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:54,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:40:54,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:40:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2021-09-13 11:40:54,988 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2021-09-13 11:40:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:40:54,989 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-09-13 11:40:54,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2021-09-13 11:40:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 11:40:54,990 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:40:54,990 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:40:55,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 11:40:55,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-09-13 11:40:55,216 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:40:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:40:55,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1842440164, now seen corresponding path program 1 times [2021-09-13 11:40:55,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:40:55,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791208479] [2021-09-13 11:40:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:55,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:40:55,231 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:40:55,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766690826] [2021-09-13 11:40:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:55,232 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:40:55,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:40:55,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:40:55,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 11:40:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:55,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 11:40:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:55,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:40:55,429 INFO L281 TraceCheckUtils]: 0: Hoare triple {527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {527#true} is VALID [2021-09-13 11:40:55,430 INFO L281 TraceCheckUtils]: 1: Hoare triple {527#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {527#true} is VALID [2021-09-13 11:40:55,430 INFO L281 TraceCheckUtils]: 2: Hoare triple {527#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {527#true} is VALID [2021-09-13 11:40:55,430 INFO L281 TraceCheckUtils]: 3: Hoare triple {527#true} assume !(0 == assume_abort_if_not_~cond); {527#true} is VALID [2021-09-13 11:40:55,431 INFO L281 TraceCheckUtils]: 4: Hoare triple {527#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {544#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 11:40:55,432 INFO L281 TraceCheckUtils]: 5: Hoare triple {544#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {548#(< 1 ~N~0)} is VALID [2021-09-13 11:40:55,441 INFO L281 TraceCheckUtils]: 6: Hoare triple {548#(< 1 ~N~0)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {548#(< 1 ~N~0)} is VALID [2021-09-13 11:40:55,441 INFO L281 TraceCheckUtils]: 7: Hoare triple {548#(< 1 ~N~0)} assume !(main_~i~0 < ~N~0); {548#(< 1 ~N~0)} is VALID [2021-09-13 11:40:55,442 INFO L281 TraceCheckUtils]: 8: Hoare triple {548#(< 1 ~N~0)} main_~i~0 := 1; {558#(and (<= ULTIMATE.start_main_~i~0 1) (< 1 ~N~0))} is VALID [2021-09-13 11:40:55,442 INFO L281 TraceCheckUtils]: 9: Hoare triple {558#(and (<= ULTIMATE.start_main_~i~0 1) (< 1 ~N~0))} assume !(main_~i~0 < ~N~0); {528#false} is VALID [2021-09-13 11:40:55,442 INFO L281 TraceCheckUtils]: 10: Hoare triple {528#false} main_~i~0 := 0; {528#false} is VALID [2021-09-13 11:40:55,443 INFO L281 TraceCheckUtils]: 11: Hoare triple {528#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {528#false} is VALID [2021-09-13 11:40:55,447 INFO L281 TraceCheckUtils]: 12: Hoare triple {528#false} assume 0 == __VERIFIER_assert_~cond; {528#false} is VALID [2021-09-13 11:40:55,447 INFO L281 TraceCheckUtils]: 13: Hoare triple {528#false} assume !false; {528#false} is VALID [2021-09-13 11:40:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:40:55,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:40:55,538 INFO L281 TraceCheckUtils]: 13: Hoare triple {528#false} assume !false; {528#false} is VALID [2021-09-13 11:40:55,539 INFO L281 TraceCheckUtils]: 12: Hoare triple {528#false} assume 0 == __VERIFIER_assert_~cond; {528#false} is VALID [2021-09-13 11:40:55,539 INFO L281 TraceCheckUtils]: 11: Hoare triple {528#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {528#false} is VALID [2021-09-13 11:40:55,539 INFO L281 TraceCheckUtils]: 10: Hoare triple {528#false} main_~i~0 := 0; {528#false} is VALID [2021-09-13 11:40:55,539 INFO L281 TraceCheckUtils]: 9: Hoare triple {586#(< ULTIMATE.start_main_~i~0 ~N~0)} assume !(main_~i~0 < ~N~0); {528#false} is VALID [2021-09-13 11:40:55,540 INFO L281 TraceCheckUtils]: 8: Hoare triple {548#(< 1 ~N~0)} main_~i~0 := 1; {586#(< ULTIMATE.start_main_~i~0 ~N~0)} is VALID [2021-09-13 11:40:55,540 INFO L281 TraceCheckUtils]: 7: Hoare triple {548#(< 1 ~N~0)} assume !(main_~i~0 < ~N~0); {548#(< 1 ~N~0)} is VALID [2021-09-13 11:40:55,542 INFO L281 TraceCheckUtils]: 6: Hoare triple {548#(< 1 ~N~0)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {548#(< 1 ~N~0)} is VALID [2021-09-13 11:40:55,543 INFO L281 TraceCheckUtils]: 5: Hoare triple {544#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {548#(< 1 ~N~0)} is VALID [2021-09-13 11:40:55,544 INFO L281 TraceCheckUtils]: 4: Hoare triple {527#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {544#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 11:40:55,544 INFO L281 TraceCheckUtils]: 3: Hoare triple {527#true} assume !(0 == assume_abort_if_not_~cond); {527#true} is VALID [2021-09-13 11:40:55,544 INFO L281 TraceCheckUtils]: 2: Hoare triple {527#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {527#true} is VALID [2021-09-13 11:40:55,545 INFO L281 TraceCheckUtils]: 1: Hoare triple {527#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {527#true} is VALID [2021-09-13 11:40:55,545 INFO L281 TraceCheckUtils]: 0: Hoare triple {527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {527#true} is VALID [2021-09-13 11:40:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:40:55,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:40:55,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791208479] [2021-09-13 11:40:55,545 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:40:55,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766690826] [2021-09-13 11:40:55,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766690826] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:40:55,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:40:55,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-09-13 11:40:55,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738275024] [2021-09-13 11:40:55,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 11:40:55,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:40:55,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:55,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:55,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 11:40:55,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:40:55,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 11:40:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 11:40:55,562 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:55,819 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-09-13 11:40:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 11:40:55,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 11:40:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:40:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2021-09-13 11:40:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2021-09-13 11:40:55,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2021-09-13 11:40:55,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:55,881 INFO L225 Difference]: With dead ends: 44 [2021-09-13 11:40:55,881 INFO L226 Difference]: Without dead ends: 37 [2021-09-13 11:40:55,881 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 55.63ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-09-13 11:40:55,882 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 105.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.52ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 107.59ms IncrementalHoareTripleChecker+Time [2021-09-13 11:40:55,882 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 104 Unknown, 0 Unchecked, 1.52ms Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 107.59ms Time] [2021-09-13 11:40:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-09-13 11:40:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2021-09-13 11:40:55,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:40:55,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:55,900 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:55,900 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:55,903 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2021-09-13 11:40:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2021-09-13 11:40:55,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:55,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:55,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2021-09-13 11:40:55,904 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2021-09-13 11:40:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:55,908 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2021-09-13 11:40:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2021-09-13 11:40:55,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:55,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:55,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:40:55,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:40:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-09-13 11:40:55,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2021-09-13 11:40:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:40:55,915 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-09-13 11:40:55,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-09-13 11:40:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 11:40:55,916 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:40:55,916 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:40:55,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-09-13 11:40:56,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:40:56,137 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:40:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:40:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1667884396, now seen corresponding path program 1 times [2021-09-13 11:40:56,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:40:56,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722282974] [2021-09-13 11:40:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:56,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:40:56,149 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:40:56,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471340587] [2021-09-13 11:40:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:56,150 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:40:56,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:40:56,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:40:56,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 11:40:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:56,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 11:40:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:56,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:40:56,384 INFO L281 TraceCheckUtils]: 0: Hoare triple {780#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {780#true} is VALID [2021-09-13 11:40:56,385 INFO L281 TraceCheckUtils]: 1: Hoare triple {780#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {780#true} is VALID [2021-09-13 11:40:56,385 INFO L281 TraceCheckUtils]: 2: Hoare triple {780#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {780#true} is VALID [2021-09-13 11:40:56,385 INFO L281 TraceCheckUtils]: 3: Hoare triple {780#true} assume !(0 == assume_abort_if_not_~cond); {780#true} is VALID [2021-09-13 11:40:56,387 INFO L281 TraceCheckUtils]: 4: Hoare triple {780#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {797#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:40:56,388 INFO L281 TraceCheckUtils]: 5: Hoare triple {797#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < ~N~0); {801#(<= ~N~0 1)} is VALID [2021-09-13 11:40:56,388 INFO L281 TraceCheckUtils]: 6: Hoare triple {801#(<= ~N~0 1)} main_~i~0 := 1; {801#(<= ~N~0 1)} is VALID [2021-09-13 11:40:56,389 INFO L281 TraceCheckUtils]: 7: Hoare triple {801#(<= ~N~0 1)} assume !(main_~i~0 < ~N~0); {801#(<= ~N~0 1)} is VALID [2021-09-13 11:40:56,389 INFO L281 TraceCheckUtils]: 8: Hoare triple {801#(<= ~N~0 1)} main_~i~0 := 0; {811#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2021-09-13 11:40:56,389 INFO L281 TraceCheckUtils]: 9: Hoare triple {811#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {811#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2021-09-13 11:40:56,390 INFO L281 TraceCheckUtils]: 10: Hoare triple {811#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !(0 == __VERIFIER_assert_~cond); {811#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2021-09-13 11:40:56,391 INFO L281 TraceCheckUtils]: 11: Hoare triple {811#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} havoc main_#t~mem16; {811#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2021-09-13 11:40:56,392 INFO L281 TraceCheckUtils]: 12: Hoare triple {811#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {824#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} is VALID [2021-09-13 11:40:56,393 INFO L281 TraceCheckUtils]: 13: Hoare triple {824#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {781#false} is VALID [2021-09-13 11:40:56,393 INFO L281 TraceCheckUtils]: 14: Hoare triple {781#false} assume 0 == __VERIFIER_assert_~cond; {781#false} is VALID [2021-09-13 11:40:56,393 INFO L281 TraceCheckUtils]: 15: Hoare triple {781#false} assume !false; {781#false} is VALID [2021-09-13 11:40:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:40:56,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 11:40:56,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:40:56,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722282974] [2021-09-13 11:40:56,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:40:56,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471340587] [2021-09-13 11:40:56,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471340587] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 11:40:56,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 11:40:56,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 11:40:56,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979169175] [2021-09-13 11:40:56,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 11:40:56,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:40:56,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:56,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:56,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 11:40:56,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:40:56,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 11:40:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 11:40:56,412 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:56,579 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2021-09-13 11:40:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 11:40:56,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 11:40:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:40:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2021-09-13 11:40:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2021-09-13 11:40:56,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2021-09-13 11:40:56,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:40:56,622 INFO L225 Difference]: With dead ends: 41 [2021-09-13 11:40:56,622 INFO L226 Difference]: Without dead ends: 27 [2021-09-13 11:40:56,622 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.20ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-09-13 11:40:56,623 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.81ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.30ms IncrementalHoareTripleChecker+Time [2021-09-13 11:40:56,623 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 84 Unknown, 0 Unchecked, 0.81ms Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 65.30ms Time] [2021-09-13 11:40:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-09-13 11:40:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2021-09-13 11:40:56,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:40:56,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:56,643 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:56,643 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:56,644 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2021-09-13 11:40:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-09-13 11:40:56,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:56,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:56,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2021-09-13 11:40:56,645 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2021-09-13 11:40:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:40:56,646 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2021-09-13 11:40:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-09-13 11:40:56,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:40:56,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:40:56,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:40:56,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:40:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-09-13 11:40:56,648 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2021-09-13 11:40:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:40:56,648 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-09-13 11:40:56,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:40:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2021-09-13 11:40:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 11:40:56,649 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:40:56,649 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:40:56,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 11:40:56,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:40:56,858 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:40:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:40:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2021-09-13 11:40:56,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:40:56,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138831732] [2021-09-13 11:40:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:56,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:40:56,903 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:40:56,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475593746] [2021-09-13 11:40:56,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:40:56,904 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:40:56,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:40:56,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:40:56,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-09-13 11:40:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:56,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 11:40:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:40:56,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:40:57,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-09-13 11:40:57,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-09-13 11:40:59,939 INFO L354 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2021-09-13 11:40:59,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2021-09-13 11:41:03,939 INFO L354 Elim1Store]: treesize reduction 124, result has 16.2 percent of original size [2021-09-13 11:41:03,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 48 [2021-09-13 11:41:05,879 INFO L281 TraceCheckUtils]: 0: Hoare triple {968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {968#true} is VALID [2021-09-13 11:41:05,880 INFO L281 TraceCheckUtils]: 1: Hoare triple {968#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {968#true} is VALID [2021-09-13 11:41:05,880 INFO L281 TraceCheckUtils]: 2: Hoare triple {968#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {968#true} is VALID [2021-09-13 11:41:05,880 INFO L281 TraceCheckUtils]: 3: Hoare triple {968#true} assume !(0 == assume_abort_if_not_~cond); {968#true} is VALID [2021-09-13 11:41:05,881 INFO L281 TraceCheckUtils]: 4: Hoare triple {968#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {985#(and (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:05,882 INFO L281 TraceCheckUtils]: 5: Hoare triple {985#(and (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {989#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:05,883 INFO L281 TraceCheckUtils]: 6: Hoare triple {989#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {989#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:05,883 INFO L281 TraceCheckUtils]: 7: Hoare triple {989#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !(main_~i~0 < ~N~0); {989#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:05,884 INFO L281 TraceCheckUtils]: 8: Hoare triple {989#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} main_~i~0 := 1; {999#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:05,907 INFO L281 TraceCheckUtils]: 9: Hoare triple {999#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 1) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1003#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))))} is VALID [2021-09-13 11:41:05,908 INFO L281 TraceCheckUtils]: 10: Hoare triple {1003#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))))} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1003#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))))} is VALID [2021-09-13 11:41:05,909 INFO L281 TraceCheckUtils]: 11: Hoare triple {1003#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))))} assume !(main_~i~0 < ~N~0); {1003#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))))} is VALID [2021-09-13 11:41:05,909 INFO L281 TraceCheckUtils]: 12: Hoare triple {1003#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))))} main_~i~0 := 0; {1013#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 0) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))))} is VALID [2021-09-13 11:41:05,925 INFO L281 TraceCheckUtils]: 13: Hoare triple {1013#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 0) (exists ((ULTIMATE.start_main_~a~0.base Int) (ULTIMATE.start_main_~a~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (not (= ULTIMATE.start_main_~b~0.base ULTIMATE.start_main_~a~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1017#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 11:41:05,925 INFO L281 TraceCheckUtils]: 14: Hoare triple {1017#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {969#false} is VALID [2021-09-13 11:41:05,925 INFO L281 TraceCheckUtils]: 15: Hoare triple {969#false} assume !false; {969#false} is VALID [2021-09-13 11:41:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:41:05,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:41:08,898 INFO L281 TraceCheckUtils]: 15: Hoare triple {969#false} assume !false; {969#false} is VALID [2021-09-13 11:41:08,899 INFO L281 TraceCheckUtils]: 14: Hoare triple {1017#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {969#false} is VALID [2021-09-13 11:41:08,901 INFO L281 TraceCheckUtils]: 13: Hoare triple {1030#(and (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1017#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 11:41:08,902 INFO L281 TraceCheckUtils]: 12: Hoare triple {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_~i~0 := 0; {1030#(and (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))} is VALID [2021-09-13 11:41:08,902 INFO L281 TraceCheckUtils]: 11: Hoare triple {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} assume !(main_~i~0 < ~N~0); {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:41:08,903 INFO L281 TraceCheckUtils]: 10: Hoare triple {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:41:08,907 INFO L281 TraceCheckUtils]: 9: Hoare triple {1044#(= (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~b~0.offset) 1)} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:41:08,908 INFO L281 TraceCheckUtils]: 8: Hoare triple {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_~i~0 := 1; {1044#(= (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:41:08,909 INFO L281 TraceCheckUtils]: 7: Hoare triple {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} assume !(main_~i~0 < ~N~0); {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:41:08,909 INFO L281 TraceCheckUtils]: 6: Hoare triple {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:41:08,924 INFO L281 TraceCheckUtils]: 5: Hoare triple {1057#(and (or (and (or (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)))) (<= (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296)) (and (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))))} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {1034#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:41:08,926 INFO L281 TraceCheckUtils]: 4: Hoare triple {968#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1057#(and (or (and (or (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)))) (<= (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296)) (and (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))))} is VALID [2021-09-13 11:41:08,926 INFO L281 TraceCheckUtils]: 3: Hoare triple {968#true} assume !(0 == assume_abort_if_not_~cond); {968#true} is VALID [2021-09-13 11:41:08,926 INFO L281 TraceCheckUtils]: 2: Hoare triple {968#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {968#true} is VALID [2021-09-13 11:41:08,926 INFO L281 TraceCheckUtils]: 1: Hoare triple {968#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {968#true} is VALID [2021-09-13 11:41:08,926 INFO L281 TraceCheckUtils]: 0: Hoare triple {968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {968#true} is VALID [2021-09-13 11:41:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:41:08,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:41:08,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138831732] [2021-09-13 11:41:08,927 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:41:08,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475593746] [2021-09-13 11:41:08,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475593746] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:41:08,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:41:08,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-09-13 11:41:08,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40076441] [2021-09-13 11:41:08,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 11:41:08,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:41:08,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:09,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:41:09,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 11:41:09,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:41:09,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 11:41:09,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-09-13 11:41:09,003 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:41:13,430 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-09-13 11:41:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 11:41:13,431 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 11:41:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:41:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2021-09-13 11:41:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2021-09-13 11:41:13,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 46 transitions. [2021-09-13 11:41:13,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:41:13,509 INFO L225 Difference]: With dead ends: 41 [2021-09-13 11:41:13,509 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 11:41:13,509 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 3850.84ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-09-13 11:41:13,510 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1208.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.25ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 1212.07ms IncrementalHoareTripleChecker+Time [2021-09-13 11:41:13,511 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 145 Unknown, 0 Unchecked, 2.25ms Time], IncrementalHoareTripleChecker [13 Valid, 107 Invalid, 0 Unknown, 25 Unchecked, 1212.07ms Time] [2021-09-13 11:41:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 11:41:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2021-09-13 11:41:13,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:41:13,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:13,537 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:13,537 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:41:13,538 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2021-09-13 11:41:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2021-09-13 11:41:13,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:41:13,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:41:13,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2021-09-13 11:41:13,539 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2021-09-13 11:41:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:41:13,540 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2021-09-13 11:41:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2021-09-13 11:41:13,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:41:13,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:41:13,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:41:13,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:41:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-09-13 11:41:13,541 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2021-09-13 11:41:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:41:13,542 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-09-13 11:41:13,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-09-13 11:41:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 11:41:13,542 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:41:13,543 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:41:13,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-09-13 11:41:13,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:41:13,749 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:41:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:41:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1267903976, now seen corresponding path program 2 times [2021-09-13 11:41:13,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:41:13,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512289054] [2021-09-13 11:41:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:41:13,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:41:13,778 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:41:13,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291480337] [2021-09-13 11:41:13,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 11:41:13,779 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:41:13,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:41:13,780 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:41:13,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-09-13 11:41:13,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 11:41:13,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 11:41:13,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2021-09-13 11:41:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:41:13,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:41:14,606 INFO L281 TraceCheckUtils]: 0: Hoare triple {1253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {1253#true} is VALID [2021-09-13 11:41:14,606 INFO L281 TraceCheckUtils]: 1: Hoare triple {1253#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1253#true} is VALID [2021-09-13 11:41:14,606 INFO L281 TraceCheckUtils]: 2: Hoare triple {1253#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1253#true} is VALID [2021-09-13 11:41:14,607 INFO L281 TraceCheckUtils]: 3: Hoare triple {1253#true} assume !(0 == assume_abort_if_not_~cond); {1253#true} is VALID [2021-09-13 11:41:14,607 INFO L281 TraceCheckUtils]: 4: Hoare triple {1253#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1270#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:41:14,608 INFO L281 TraceCheckUtils]: 5: Hoare triple {1270#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {1270#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:41:14,608 INFO L281 TraceCheckUtils]: 6: Hoare triple {1270#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1277#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2021-09-13 11:41:14,609 INFO L281 TraceCheckUtils]: 7: Hoare triple {1277#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < ~N~0); {1281#(<= ~N~0 2)} is VALID [2021-09-13 11:41:14,610 INFO L281 TraceCheckUtils]: 8: Hoare triple {1281#(<= ~N~0 2)} main_~i~0 := 1; {1285#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:41:14,610 INFO L281 TraceCheckUtils]: 9: Hoare triple {1285#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1285#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:41:14,611 INFO L281 TraceCheckUtils]: 10: Hoare triple {1285#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1292#(and (<= 2 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:41:14,612 INFO L281 TraceCheckUtils]: 11: Hoare triple {1292#(and (<= 2 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1254#false} is VALID [2021-09-13 11:41:14,613 INFO L281 TraceCheckUtils]: 12: Hoare triple {1254#false} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1254#false} is VALID [2021-09-13 11:41:14,613 INFO L281 TraceCheckUtils]: 13: Hoare triple {1254#false} assume !(main_~i~0 < ~N~0); {1254#false} is VALID [2021-09-13 11:41:14,613 INFO L281 TraceCheckUtils]: 14: Hoare triple {1254#false} main_~i~0 := 0; {1254#false} is VALID [2021-09-13 11:41:14,613 INFO L281 TraceCheckUtils]: 15: Hoare triple {1254#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1254#false} is VALID [2021-09-13 11:41:14,613 INFO L281 TraceCheckUtils]: 16: Hoare triple {1254#false} assume 0 == __VERIFIER_assert_~cond; {1254#false} is VALID [2021-09-13 11:41:14,614 INFO L281 TraceCheckUtils]: 17: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2021-09-13 11:41:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:41:14,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:41:15,051 INFO L281 TraceCheckUtils]: 17: Hoare triple {1254#false} assume !false; {1254#false} is VALID [2021-09-13 11:41:15,051 INFO L281 TraceCheckUtils]: 16: Hoare triple {1254#false} assume 0 == __VERIFIER_assert_~cond; {1254#false} is VALID [2021-09-13 11:41:15,051 INFO L281 TraceCheckUtils]: 15: Hoare triple {1254#false} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1254#false} is VALID [2021-09-13 11:41:15,051 INFO L281 TraceCheckUtils]: 14: Hoare triple {1254#false} main_~i~0 := 0; {1254#false} is VALID [2021-09-13 11:41:15,051 INFO L281 TraceCheckUtils]: 13: Hoare triple {1254#false} assume !(main_~i~0 < ~N~0); {1254#false} is VALID [2021-09-13 11:41:15,052 INFO L281 TraceCheckUtils]: 12: Hoare triple {1254#false} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1254#false} is VALID [2021-09-13 11:41:15,052 INFO L281 TraceCheckUtils]: 11: Hoare triple {1332#(<= ~N~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1254#false} is VALID [2021-09-13 11:41:15,053 INFO L281 TraceCheckUtils]: 10: Hoare triple {1336#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1332#(<= ~N~0 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 11:41:15,053 INFO L281 TraceCheckUtils]: 9: Hoare triple {1336#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1336#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} is VALID [2021-09-13 11:41:15,054 INFO L281 TraceCheckUtils]: 8: Hoare triple {1281#(<= ~N~0 2)} main_~i~0 := 1; {1336#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} is VALID [2021-09-13 11:41:15,054 INFO L281 TraceCheckUtils]: 7: Hoare triple {1277#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < ~N~0); {1281#(<= ~N~0 2)} is VALID [2021-09-13 11:41:15,055 INFO L281 TraceCheckUtils]: 6: Hoare triple {1270#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1277#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2021-09-13 11:41:15,055 INFO L281 TraceCheckUtils]: 5: Hoare triple {1270#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {1270#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:41:15,056 INFO L281 TraceCheckUtils]: 4: Hoare triple {1253#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1270#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:41:15,056 INFO L281 TraceCheckUtils]: 3: Hoare triple {1253#true} assume !(0 == assume_abort_if_not_~cond); {1253#true} is VALID [2021-09-13 11:41:15,056 INFO L281 TraceCheckUtils]: 2: Hoare triple {1253#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1253#true} is VALID [2021-09-13 11:41:15,056 INFO L281 TraceCheckUtils]: 1: Hoare triple {1253#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1253#true} is VALID [2021-09-13 11:41:15,056 INFO L281 TraceCheckUtils]: 0: Hoare triple {1253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {1253#true} is VALID [2021-09-13 11:41:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:41:15,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:41:15,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512289054] [2021-09-13 11:41:15,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:41:15,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291480337] [2021-09-13 11:41:15,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291480337] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:41:15,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:41:15,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-09-13 11:41:15,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631522249] [2021-09-13 11:41:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-13 11:41:15,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:41:15,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:15,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:41:15,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 11:41:15,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:41:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 11:41:15,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-09-13 11:41:15,077 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:41:18,127 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-09-13 11:41:18,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 11:41:18,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-13 11:41:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:41:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2021-09-13 11:41:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 65 transitions. [2021-09-13 11:41:18,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 65 transitions. [2021-09-13 11:41:18,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:41:18,198 INFO L225 Difference]: With dead ends: 67 [2021-09-13 11:41:18,198 INFO L226 Difference]: Without dead ends: 58 [2021-09-13 11:41:18,198 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1059.08ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-09-13 11:41:18,199 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1221.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.05ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1224.19ms IncrementalHoareTripleChecker+Time [2021-09-13 11:41:18,200 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 160 Unknown, 0 Unchecked, 3.05ms Time], IncrementalHoareTripleChecker [19 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1224.19ms Time] [2021-09-13 11:41:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-09-13 11:41:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2021-09-13 11:41:18,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:41:18,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:18,244 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:18,244 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:41:18,245 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2021-09-13 11:41:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2021-09-13 11:41:18,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:41:18,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:41:18,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2021-09-13 11:41:18,246 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2021-09-13 11:41:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:41:18,247 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2021-09-13 11:41:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2021-09-13 11:41:18,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:41:18,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:41:18,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:41:18,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:41:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-09-13 11:41:18,249 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2021-09-13 11:41:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:41:18,250 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-09-13 11:41:18,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-09-13 11:41:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 11:41:18,251 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:41:18,251 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:41:18,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-09-13 11:41:18,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:41:18,465 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:41:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:41:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash 798963152, now seen corresponding path program 1 times [2021-09-13 11:41:18,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:41:18,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719231807] [2021-09-13 11:41:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:41:18,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:41:18,477 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:41:18,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249695547] [2021-09-13 11:41:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:41:18,478 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:41:18,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:41:18,493 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:41:18,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-09-13 11:41:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:41:18,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2021-09-13 11:41:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:41:18,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:41:18,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-09-13 11:41:18,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-09-13 11:41:22,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:22,485 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-09-13 11:41:22,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2021-09-13 11:41:27,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:27,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:27,411 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-09-13 11:41:27,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 45 treesize of output 42 [2021-09-13 11:41:29,404 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-09-13 11:41:29,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 40 [2021-09-13 11:41:29,627 INFO L281 TraceCheckUtils]: 0: Hoare triple {1624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {1624#true} is VALID [2021-09-13 11:41:29,627 INFO L281 TraceCheckUtils]: 1: Hoare triple {1624#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1624#true} is VALID [2021-09-13 11:41:29,628 INFO L281 TraceCheckUtils]: 2: Hoare triple {1624#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1624#true} is VALID [2021-09-13 11:41:29,628 INFO L281 TraceCheckUtils]: 3: Hoare triple {1624#true} assume !(0 == assume_abort_if_not_~cond); {1624#true} is VALID [2021-09-13 11:41:29,629 INFO L281 TraceCheckUtils]: 4: Hoare triple {1624#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1641#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:29,631 INFO L281 TraceCheckUtils]: 5: Hoare triple {1641#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {1645#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:29,631 INFO L281 TraceCheckUtils]: 6: Hoare triple {1645#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1645#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:29,632 INFO L281 TraceCheckUtils]: 7: Hoare triple {1645#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !(main_~i~0 < ~N~0); {1645#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:29,632 INFO L281 TraceCheckUtils]: 8: Hoare triple {1645#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} main_~i~0 := 1; {1655#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:29,655 INFO L281 TraceCheckUtils]: 9: Hoare triple {1655#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1659#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:41:29,656 INFO L281 TraceCheckUtils]: 10: Hoare triple {1659#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~b~0.offset 0))} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1659#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:41:29,656 INFO L281 TraceCheckUtils]: 11: Hoare triple {1659#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~b~0.offset 0))} assume !(main_~i~0 < ~N~0); {1659#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:41:29,657 INFO L281 TraceCheckUtils]: 12: Hoare triple {1659#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~b~0.offset 0))} main_~i~0 := 0; {1669#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:41:29,658 INFO L281 TraceCheckUtils]: 13: Hoare triple {1669#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1669#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:41:29,659 INFO L281 TraceCheckUtils]: 14: Hoare triple {1669#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0))} assume !(0 == __VERIFIER_assert_~cond); {1669#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:41:29,659 INFO L281 TraceCheckUtils]: 15: Hoare triple {1669#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0))} havoc main_#t~mem16; {1669#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:41:29,660 INFO L281 TraceCheckUtils]: 16: Hoare triple {1669#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {1682#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:41:29,661 INFO L281 TraceCheckUtils]: 17: Hoare triple {1682#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 8))) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 11:41:29,662 INFO L281 TraceCheckUtils]: 18: Hoare triple {1686#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1625#false} is VALID [2021-09-13 11:41:29,662 INFO L281 TraceCheckUtils]: 19: Hoare triple {1625#false} assume !false; {1625#false} is VALID [2021-09-13 11:41:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:41:29,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:41:34,365 INFO L281 TraceCheckUtils]: 19: Hoare triple {1625#false} assume !false; {1625#false} is VALID [2021-09-13 11:41:34,366 INFO L281 TraceCheckUtils]: 18: Hoare triple {1686#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1625#false} is VALID [2021-09-13 11:41:34,370 INFO L281 TraceCheckUtils]: 17: Hoare triple {1699#(and (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 11:41:34,394 INFO L281 TraceCheckUtils]: 16: Hoare triple {1703#(and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {1699#(and (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))} is VALID [2021-09-13 11:41:34,395 INFO L281 TraceCheckUtils]: 15: Hoare triple {1703#(and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))} havoc main_#t~mem16; {1703#(and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))} is VALID [2021-09-13 11:41:34,396 INFO L281 TraceCheckUtils]: 14: Hoare triple {1703#(and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))} assume !(0 == __VERIFIER_assert_~cond); {1703#(and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))} is VALID [2021-09-13 11:41:34,397 INFO L281 TraceCheckUtils]: 13: Hoare triple {1703#(and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1703#(and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))} is VALID [2021-09-13 11:41:34,397 INFO L281 TraceCheckUtils]: 12: Hoare triple {1716#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9)} main_~i~0 := 0; {1703#(and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368))) (+ 9 (* 12 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))} is VALID [2021-09-13 11:41:34,397 INFO L281 TraceCheckUtils]: 11: Hoare triple {1716#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9)} assume !(main_~i~0 < ~N~0); {1716#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9)} is VALID [2021-09-13 11:41:34,398 INFO L281 TraceCheckUtils]: 10: Hoare triple {1716#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9)} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1716#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9)} is VALID [2021-09-13 11:41:34,402 INFO L281 TraceCheckUtils]: 9: Hoare triple {1726#(= (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))))) (+ ULTIMATE.start_main_~b~0.offset 8)) 9)} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1716#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9)} is VALID [2021-09-13 11:41:34,402 INFO L281 TraceCheckUtils]: 8: Hoare triple {1730#(= 9 (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} main_~i~0 := 1; {1726#(= (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))))) (+ ULTIMATE.start_main_~b~0.offset 8)) 9)} is VALID [2021-09-13 11:41:34,403 INFO L281 TraceCheckUtils]: 7: Hoare triple {1730#(= 9 (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !(main_~i~0 < ~N~0); {1730#(= 9 (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:34,403 INFO L281 TraceCheckUtils]: 6: Hoare triple {1730#(= 9 (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1730#(= 9 (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:34,424 INFO L281 TraceCheckUtils]: 5: Hoare triple {1740#(and (or (and (or (= 9 (+ (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) ULTIMATE.start_main_~a~0.offset))) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)) (or (= 9 (+ (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) ULTIMATE.start_main_~a~0.offset))) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)))) (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296))) (or (and (or (= 9 (+ (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~a~0.offset))) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (+ (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~a~0.offset)) 9) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647))) (<= (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 2147483647)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {1730#(= 9 (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:41:34,427 INFO L281 TraceCheckUtils]: 4: Hoare triple {1624#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1740#(and (or (and (or (= 9 (+ (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) ULTIMATE.start_main_~a~0.offset))) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)) (or (= 9 (+ (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) ULTIMATE.start_main_~a~0.offset))) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)))) (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296))) (or (and (or (= 9 (+ (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~a~0.offset))) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (+ (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) (select (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~a~0.offset)) 9) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647))) (<= (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 2147483647)))} is VALID [2021-09-13 11:41:34,427 INFO L281 TraceCheckUtils]: 3: Hoare triple {1624#true} assume !(0 == assume_abort_if_not_~cond); {1624#true} is VALID [2021-09-13 11:41:34,427 INFO L281 TraceCheckUtils]: 2: Hoare triple {1624#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1624#true} is VALID [2021-09-13 11:41:34,427 INFO L281 TraceCheckUtils]: 1: Hoare triple {1624#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1624#true} is VALID [2021-09-13 11:41:34,427 INFO L281 TraceCheckUtils]: 0: Hoare triple {1624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {1624#true} is VALID [2021-09-13 11:41:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:41:34,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:41:34,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719231807] [2021-09-13 11:41:34,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:41:34,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249695547] [2021-09-13 11:41:34,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249695547] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:41:34,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:41:34,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-09-13 11:41:34,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796048881] [2021-09-13 11:41:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 11:41:34,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:41:34,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:36,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 11:41:36,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-13 11:41:36,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:41:36,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-13 11:41:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-09-13 11:41:36,682 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:41:39,567 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-09-13 11:41:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 11:41:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 11:41:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:41:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2021-09-13 11:41:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2021-09-13 11:41:39,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2021-09-13 11:41:39,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:41:39,644 INFO L225 Difference]: With dead ends: 40 [2021-09-13 11:41:39,644 INFO L226 Difference]: Without dead ends: 38 [2021-09-13 11:41:39,645 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 4195.01ms TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-09-13 11:41:39,645 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 858.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.46ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 860.32ms IncrementalHoareTripleChecker+Time [2021-09-13 11:41:39,645 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 106 Unknown, 0 Unchecked, 1.46ms Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 24 Unchecked, 860.32ms Time] [2021-09-13 11:41:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-09-13 11:41:39,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-09-13 11:41:39,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:41:39,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:39,696 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:39,696 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:41:39,697 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-09-13 11:41:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 11:41:39,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:41:39,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:41:39,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2021-09-13 11:41:39,698 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2021-09-13 11:41:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:41:39,699 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-09-13 11:41:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 11:41:39,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:41:39,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:41:39,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:41:39,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:41:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-09-13 11:41:39,701 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 20 [2021-09-13 11:41:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:41:39,701 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-09-13 11:41:39,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:41:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 11:41:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 11:41:39,702 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:41:39,702 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:41:39,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-09-13 11:41:39,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:41:39,903 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:41:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:41:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1786143722, now seen corresponding path program 3 times [2021-09-13 11:41:39,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:41:39,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424124484] [2021-09-13 11:41:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:41:39,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:41:39,933 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:41:39,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136323389] [2021-09-13 11:41:39,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 11:41:39,933 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:41:39,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:41:39,936 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:41:39,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-09-13 11:41:40,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-09-13 11:41:40,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 11:41:40,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 26 conjunts are in the unsatisfiable core [2021-09-13 11:41:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:41:40,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:41:40,247 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-09-13 11:41:40,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-09-13 11:41:40,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-09-13 11:41:43,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:43,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:43,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:43,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:43,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:43,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:43,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:43,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:43,977 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-09-13 11:41:43,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 304 [2021-09-13 11:41:44,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:44,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 60 [2021-09-13 11:41:44,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:44,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2021-09-13 11:41:44,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:44,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:44,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 75 [2021-09-13 11:41:48,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:48,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:48,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:48,092 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-09-13 11:41:48,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 46 [2021-09-13 11:41:52,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:52,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:53,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:53,222 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:53,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:53,455 INFO L354 Elim1Store]: treesize reduction 86, result has 18.1 percent of original size [2021-09-13 11:41:53,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 30 case distinctions, treesize of input 270 treesize of output 510 [2021-09-13 11:41:53,609 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-09-13 11:41:53,664 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-09-13 11:41:54,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:54,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:54,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,444 INFO L244 Elim1Store]: Index analysis took 150 ms [2021-09-13 11:41:54,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 163 [2021-09-13 11:41:54,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:54,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:54,684 INFO L244 Elim1Store]: Index analysis took 145 ms [2021-09-13 11:41:54,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 194 [2021-09-13 11:41:54,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:54,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:54,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:55,001 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-09-13 11:41:55,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 236 treesize of output 124 [2021-09-13 11:41:59,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:59,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:59,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:59,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:59,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:41:59,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:41:59,596 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-09-13 11:41:59,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 69 treesize of output 66 [2021-09-13 11:42:01,491 INFO L281 TraceCheckUtils]: 0: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {1941#true} is VALID [2021-09-13 11:42:01,491 INFO L281 TraceCheckUtils]: 1: Hoare triple {1941#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1941#true} is VALID [2021-09-13 11:42:01,491 INFO L281 TraceCheckUtils]: 2: Hoare triple {1941#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1941#true} is VALID [2021-09-13 11:42:01,492 INFO L281 TraceCheckUtils]: 3: Hoare triple {1941#true} assume !(0 == assume_abort_if_not_~cond); {1941#true} is VALID [2021-09-13 11:42:01,493 INFO L281 TraceCheckUtils]: 4: Hoare triple {1941#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {1958#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:42:01,496 INFO L281 TraceCheckUtils]: 5: Hoare triple {1958#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {1962#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} is VALID [2021-09-13 11:42:01,497 INFO L281 TraceCheckUtils]: 6: Hoare triple {1962#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1966#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 2) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))))} is VALID [2021-09-13 11:42:01,500 INFO L281 TraceCheckUtils]: 7: Hoare triple {1966#(and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 2) (= ULTIMATE.start_main_~b~0.offset 0) (= 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))))} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {1970#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 8) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:42:01,500 INFO L281 TraceCheckUtils]: 8: Hoare triple {1970#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 8) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1970#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 8) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:42:01,501 INFO L281 TraceCheckUtils]: 9: Hoare triple {1970#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 8) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0))} assume !(main_~i~0 < ~N~0); {1970#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 8) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:42:01,501 INFO L281 TraceCheckUtils]: 10: Hoare triple {1970#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 8) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~b~0.offset 0))} main_~i~0 := 1; {1980#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 8) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:42:01,503 INFO L281 TraceCheckUtils]: 11: Hoare triple {1980#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 8) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~b~0.offset 0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1984#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16)) 24) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:42:01,504 INFO L281 TraceCheckUtils]: 12: Hoare triple {1984#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16)) 24) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8) (= ULTIMATE.start_main_~b~0.offset 0))} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1988#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967294) 4294967296) 8))) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967294) 4294967296) 8))) 8) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967294) 4294967296) 8))) 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16)) 24) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 2) (= ULTIMATE.start_main_~b~0.offset 0))} is VALID [2021-09-13 11:42:01,529 INFO L281 TraceCheckUtils]: 13: Hoare triple {1988#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 8)) 16) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967294) 4294967296) 8))) 1) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967294) 4294967296) 8))) 8) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967294) 4294967296) 8))) 1) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset 16)) 24) (= ULTIMATE.start_main_~a~0.offset 0) (= ULTIMATE.start_main_~i~0 2) (= ULTIMATE.start_main_~b~0.offset 0))} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {1992#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 16) 24) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 16))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~b~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9))} is VALID [2021-09-13 11:42:01,530 INFO L281 TraceCheckUtils]: 14: Hoare triple {1992#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 16) 24) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 16))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~b~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9))} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {1992#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 16) 24) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 16))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~b~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9))} is VALID [2021-09-13 11:42:01,534 INFO L281 TraceCheckUtils]: 15: Hoare triple {1992#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 16) 24) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 16))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~b~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9))} assume !(main_~i~0 < ~N~0); {1992#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 16) 24) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 16))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~b~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9))} is VALID [2021-09-13 11:42:01,535 INFO L281 TraceCheckUtils]: 16: Hoare triple {1992#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 16) 24) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 16))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~b~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9))} main_~i~0 := 0; {2002#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 16) 24) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 16))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9))} is VALID [2021-09-13 11:42:01,536 INFO L281 TraceCheckUtils]: 17: Hoare triple {2002#(and (exists ((ULTIMATE.start_main_~a~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8) 16) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 0) 1)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 16) 24) (= (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) 8)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 16))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~b~0.offset 0) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset 8)) 9))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2006#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 11:42:01,536 INFO L281 TraceCheckUtils]: 18: Hoare triple {2006#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1942#false} is VALID [2021-09-13 11:42:01,536 INFO L281 TraceCheckUtils]: 19: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2021-09-13 11:42:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:42:01,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:42:21,043 INFO L281 TraceCheckUtils]: 19: Hoare triple {1942#false} assume !false; {1942#false} is VALID [2021-09-13 11:42:21,044 INFO L281 TraceCheckUtils]: 18: Hoare triple {2006#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1942#false} is VALID [2021-09-13 11:42:21,048 INFO L281 TraceCheckUtils]: 17: Hoare triple {2019#(and (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2006#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 11:42:21,049 INFO L281 TraceCheckUtils]: 16: Hoare triple {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_~i~0 := 0; {2019#(and (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (+ (* 4 ULTIMATE.start_main_~i~0) (* 4 (* ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)) 1)) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))} is VALID [2021-09-13 11:42:21,049 INFO L281 TraceCheckUtils]: 15: Hoare triple {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} assume !(main_~i~0 < ~N~0); {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:42:21,049 INFO L281 TraceCheckUtils]: 14: Hoare triple {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:42:21,056 INFO L281 TraceCheckUtils]: 13: Hoare triple {2033#(= (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~b~0.offset) 1)} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:42:21,062 INFO L281 TraceCheckUtils]: 12: Hoare triple {2037#(= (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))))) ULTIMATE.start_main_~b~0.offset) 1)} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {2033#(= (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:42:21,095 INFO L281 TraceCheckUtils]: 11: Hoare triple {2041#(and (or (= (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ (select (select (store |#memory_int| ULTIMATE.start_main_~b~0.base (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)) (or (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)) (= (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (select (select (store |#memory_int| ULTIMATE.start_main_~b~0.base (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))))) ULTIMATE.start_main_~b~0.offset) 1)))} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {2037#(= (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))))) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:42:21,096 INFO L281 TraceCheckUtils]: 10: Hoare triple {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_~i~0 := 1; {2041#(and (or (= (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ (select (select (store |#memory_int| ULTIMATE.start_main_~b~0.base (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)) (or (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)) (= (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ (select (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~b~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) (select (select (store |#memory_int| ULTIMATE.start_main_~b~0.base (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (+ ULTIMATE.start_main_~b~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))))) ULTIMATE.start_main_~b~0.offset) 1)))} is VALID [2021-09-13 11:42:21,097 INFO L281 TraceCheckUtils]: 9: Hoare triple {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} assume !(main_~i~0 < ~N~0); {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:42:21,097 INFO L281 TraceCheckUtils]: 8: Hoare triple {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:42:21,120 INFO L281 TraceCheckUtils]: 7: Hoare triple {2054#(and (or (and (or (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)))) (<= (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296)) (and (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))))} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {2023#(= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)} is VALID [2021-09-13 11:42:21,197 INFO L281 TraceCheckUtils]: 6: Hoare triple {2058#(and (or (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647) (and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))) (or (and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647))) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {2054#(and (or (and (or (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)))) (<= (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296)) (and (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647)))))} is VALID [2021-09-13 11:42:21,484 INFO L281 TraceCheckUtils]: 5: Hoare triple {2062#(and (or (and (or (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (and (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1))) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647))) (<= (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296)) (and (or (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (and (or (= 1 (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1))) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))))))} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {2058#(and (or (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647) (and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)))) (or (and (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8))) 8))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647))) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))))} is VALID [2021-09-13 11:42:21,487 INFO L281 TraceCheckUtils]: 4: Hoare triple {1941#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {2062#(and (or (and (or (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (and (or (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ 8 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368))))) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8) (- 34359738368)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1))) (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647))) (<= (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296)) (and (or (<= (mod ULTIMATE.start_main_~i~0 4294967296) 2147483647) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (- 34359738368) (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1)) (or (and (or (= 1 (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8) (- 34359738368)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (<= (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 2147483647)) (or (< 2147483647 (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296)) (= (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod ULTIMATE.start_main_~i~0 4294967296) 8)) (+ (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8))) 8)) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 1) 4294967296) 8)) (+ 16 (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (+ ULTIMATE.start_main_~a~0.offset (* (mod (+ ULTIMATE.start_main_~i~0 4294967295) 4294967296) 8)))))) ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset) 1))) (< 2147483647 (mod ULTIMATE.start_main_~i~0 4294967296))))))} is VALID [2021-09-13 11:42:21,487 INFO L281 TraceCheckUtils]: 3: Hoare triple {1941#true} assume !(0 == assume_abort_if_not_~cond); {1941#true} is VALID [2021-09-13 11:42:21,487 INFO L281 TraceCheckUtils]: 2: Hoare triple {1941#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1941#true} is VALID [2021-09-13 11:42:21,487 INFO L281 TraceCheckUtils]: 1: Hoare triple {1941#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1941#true} is VALID [2021-09-13 11:42:21,487 INFO L281 TraceCheckUtils]: 0: Hoare triple {1941#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {1941#true} is VALID [2021-09-13 11:42:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:42:21,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:42:21,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424124484] [2021-09-13 11:42:21,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:42:21,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136323389] [2021-09-13 11:42:21,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136323389] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:42:21,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:42:21,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-09-13 11:42:21,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185723660] [2021-09-13 11:42:21,488 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 11:42:21,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:42:21,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:42:21,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:42:21,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-09-13 11:42:21,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:42:21,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-09-13 11:42:21,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2021-09-13 11:42:21,982 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:43:03,870 WARN L210 SmtUtils]: Spent 34.06s on a formula simplification. DAG size of input: 155 DAG size of output: 129 [2021-09-13 11:43:07,076 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-09-13 11:44:17,912 WARN L210 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 166 DAG size of output: 133 [2021-09-13 11:46:07,447 WARN L210 SmtUtils]: Spent 1.67m on a formula simplification. DAG size of input: 168 DAG size of output: 135 [2021-09-13 11:46:21,706 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-09-13 11:46:44,846 WARN L210 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2021-09-13 11:46:55,585 WARN L210 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2021-09-13 11:47:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:47:13,106 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2021-09-13 11:47:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-09-13 11:47:13,106 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 11:47:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:47:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 97 transitions. [2021-09-13 11:47:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 97 transitions. [2021-09-13 11:47:13,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 97 transitions. [2021-09-13 11:47:16,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 11:47:16,286 INFO L225 Difference]: With dead ends: 87 [2021-09-13 11:47:16,286 INFO L226 Difference]: Without dead ends: 85 [2021-09-13 11:47:16,287 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 240009.51ms TimeCoverageRelationStatistics Valid=342, Invalid=1064, Unknown=0, NotChecked=0, Total=1406 [2021-09-13 11:47:16,287 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25905.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.67ms SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 25980.73ms IncrementalHoareTripleChecker+Time [2021-09-13 11:47:16,287 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 499 Unknown, 0 Unchecked, 8.67ms Time], IncrementalHoareTripleChecker [60 Valid, 383 Invalid, 2 Unknown, 54 Unchecked, 25980.73ms Time] [2021-09-13 11:47:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-09-13 11:47:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 49. [2021-09-13 11:47:16,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:47:16,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:16,383 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:16,384 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:47:16,386 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2021-09-13 11:47:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2021-09-13 11:47:16,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:47:16,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:47:16,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 85 states. [2021-09-13 11:47:16,386 INFO L87 Difference]: Start difference. First operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 85 states. [2021-09-13 11:47:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:47:16,389 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2021-09-13 11:47:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2021-09-13 11:47:16,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:47:16,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:47:16,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:47:16,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:47:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2021-09-13 11:47:16,391 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 20 [2021-09-13 11:47:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:47:16,392 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2021-09-13 11:47:16,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2021-09-13 11:47:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-13 11:47:16,392 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:47:16,393 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:47:16,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-09-13 11:47:16,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-09-13 11:47:16,613 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:47:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:47:16,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1197174726, now seen corresponding path program 2 times [2021-09-13 11:47:16,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:47:16,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076379395] [2021-09-13 11:47:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:47:16,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:47:16,636 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:47:16,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1741535633] [2021-09-13 11:47:16,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 11:47:16,637 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:47:16,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:47:16,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:47:16,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-09-13 11:47:16,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 11:47:16,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 11:47:16,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 11:47:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:47:16,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:47:18,531 INFO L281 TraceCheckUtils]: 0: Hoare triple {2463#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {2463#true} is VALID [2021-09-13 11:47:18,531 INFO L281 TraceCheckUtils]: 1: Hoare triple {2463#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {2463#true} is VALID [2021-09-13 11:47:18,532 INFO L281 TraceCheckUtils]: 2: Hoare triple {2463#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2463#true} is VALID [2021-09-13 11:47:18,532 INFO L281 TraceCheckUtils]: 3: Hoare triple {2463#true} assume !(0 == assume_abort_if_not_~cond); {2463#true} is VALID [2021-09-13 11:47:18,532 INFO L281 TraceCheckUtils]: 4: Hoare triple {2463#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {2480#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:47:18,533 INFO L281 TraceCheckUtils]: 5: Hoare triple {2480#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {2480#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:47:18,534 INFO L281 TraceCheckUtils]: 6: Hoare triple {2480#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {2487#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2021-09-13 11:47:18,534 INFO L281 TraceCheckUtils]: 7: Hoare triple {2487#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < ~N~0); {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:18,534 INFO L281 TraceCheckUtils]: 8: Hoare triple {2491#(<= ~N~0 2)} main_~i~0 := 1; {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:18,535 INFO L281 TraceCheckUtils]: 9: Hoare triple {2491#(<= ~N~0 2)} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:18,535 INFO L281 TraceCheckUtils]: 10: Hoare triple {2491#(<= ~N~0 2)} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:18,535 INFO L281 TraceCheckUtils]: 11: Hoare triple {2491#(<= ~N~0 2)} assume !(main_~i~0 < ~N~0); {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:18,536 INFO L281 TraceCheckUtils]: 12: Hoare triple {2491#(<= ~N~0 2)} main_~i~0 := 0; {2507#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:47:18,536 INFO L281 TraceCheckUtils]: 13: Hoare triple {2507#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2507#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:47:18,536 INFO L281 TraceCheckUtils]: 14: Hoare triple {2507#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond); {2507#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:47:18,537 INFO L281 TraceCheckUtils]: 15: Hoare triple {2507#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} havoc main_#t~mem16; {2507#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:47:18,537 INFO L281 TraceCheckUtils]: 16: Hoare triple {2507#(and (<= 0 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2520#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:47:18,538 INFO L281 TraceCheckUtils]: 17: Hoare triple {2520#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2520#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:47:18,538 INFO L281 TraceCheckUtils]: 18: Hoare triple {2520#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond); {2520#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:47:18,539 INFO L281 TraceCheckUtils]: 19: Hoare triple {2520#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} havoc main_#t~mem16; {2520#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:47:18,540 INFO L281 TraceCheckUtils]: 20: Hoare triple {2520#(and (<= 1 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2533#(and (<= 2 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} is VALID [2021-09-13 11:47:18,541 INFO L281 TraceCheckUtils]: 21: Hoare triple {2533#(and (<= 2 ULTIMATE.start_main_~i~0) (<= ~N~0 2))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2464#false} is VALID [2021-09-13 11:47:18,541 INFO L281 TraceCheckUtils]: 22: Hoare triple {2464#false} assume 0 == __VERIFIER_assert_~cond; {2464#false} is VALID [2021-09-13 11:47:18,541 INFO L281 TraceCheckUtils]: 23: Hoare triple {2464#false} assume !false; {2464#false} is VALID [2021-09-13 11:47:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 11:47:18,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:47:19,790 INFO L281 TraceCheckUtils]: 23: Hoare triple {2464#false} assume !false; {2464#false} is VALID [2021-09-13 11:47:19,791 INFO L281 TraceCheckUtils]: 22: Hoare triple {2464#false} assume 0 == __VERIFIER_assert_~cond; {2464#false} is VALID [2021-09-13 11:47:19,791 INFO L281 TraceCheckUtils]: 21: Hoare triple {2549#(<= ~N~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2464#false} is VALID [2021-09-13 11:47:19,793 INFO L281 TraceCheckUtils]: 20: Hoare triple {2553#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2549#(<= ~N~0 ULTIMATE.start_main_~i~0)} is VALID [2021-09-13 11:47:19,794 INFO L281 TraceCheckUtils]: 19: Hoare triple {2553#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} havoc main_#t~mem16; {2553#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} is VALID [2021-09-13 11:47:19,794 INFO L281 TraceCheckUtils]: 18: Hoare triple {2553#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} assume !(0 == __VERIFIER_assert_~cond); {2553#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} is VALID [2021-09-13 11:47:19,794 INFO L281 TraceCheckUtils]: 17: Hoare triple {2553#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2553#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} is VALID [2021-09-13 11:47:19,795 INFO L281 TraceCheckUtils]: 16: Hoare triple {2566#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 2))} main_#t~post15 := main_~i~0;main_~i~0 := 1 + main_#t~post15;havoc main_#t~post15; {2553#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 1))} is VALID [2021-09-13 11:47:19,795 INFO L281 TraceCheckUtils]: 15: Hoare triple {2566#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 2))} havoc main_#t~mem16; {2566#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 2))} is VALID [2021-09-13 11:47:19,796 INFO L281 TraceCheckUtils]: 14: Hoare triple {2566#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 2))} assume !(0 == __VERIFIER_assert_~cond); {2566#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 2))} is VALID [2021-09-13 11:47:19,796 INFO L281 TraceCheckUtils]: 13: Hoare triple {2566#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 2))} assume !!(main_~i~0 < ~N~0);call main_#t~mem16 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == 1 + (4 * main_~i~0 * main_~i~0 + 4 * main_~i~0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2566#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 2))} is VALID [2021-09-13 11:47:19,796 INFO L281 TraceCheckUtils]: 12: Hoare triple {2491#(<= ~N~0 2)} main_~i~0 := 0; {2566#(<= ~N~0 (+ ULTIMATE.start_main_~i~0 2))} is VALID [2021-09-13 11:47:19,797 INFO L281 TraceCheckUtils]: 11: Hoare triple {2491#(<= ~N~0 2)} assume !(main_~i~0 < ~N~0); {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:19,797 INFO L281 TraceCheckUtils]: 10: Hoare triple {2491#(<= ~N~0 2)} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:19,797 INFO L281 TraceCheckUtils]: 9: Hoare triple {2491#(<= ~N~0 2)} assume !!(main_~i~0 < ~N~0);call main_#t~mem13 := read~int(main_~b~0.base, main_~b~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem14 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem13 + main_#t~mem14, main_~b~0.base, main_~b~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem13;havoc main_#t~mem14; {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:19,798 INFO L281 TraceCheckUtils]: 8: Hoare triple {2491#(<= ~N~0 2)} main_~i~0 := 1; {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:19,798 INFO L281 TraceCheckUtils]: 7: Hoare triple {2487#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < ~N~0); {2491#(<= ~N~0 2)} is VALID [2021-09-13 11:47:19,799 INFO L281 TraceCheckUtils]: 6: Hoare triple {2480#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {2487#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2021-09-13 11:47:19,799 INFO L281 TraceCheckUtils]: 5: Hoare triple {2480#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < ~N~0);call main_#t~mem11 := read~int(main_~a~0.base, main_~a~0.offset + 8 * (if (main_~i~0 - 1) % 4294967296 <= 2147483647 then (main_~i~0 - 1) % 4294967296 else (main_~i~0 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem11, main_~a~0.base, main_~a~0.offset + 8 * (if main_~i~0 % 4294967296 <= 2147483647 then main_~i~0 % 4294967296 else main_~i~0 % 4294967296 - 4294967296), 8);havoc main_#t~mem11; {2480#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:47:19,800 INFO L281 TraceCheckUtils]: 4: Hoare triple {2463#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(8, main_~a~0.base, main_~a~0.offset, 8);call write~int(1, main_~b~0.base, main_~b~0.offset, 8);main_~i~0 := 1; {2480#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2021-09-13 11:47:19,800 INFO L281 TraceCheckUtils]: 3: Hoare triple {2463#true} assume !(0 == assume_abort_if_not_~cond); {2463#true} is VALID [2021-09-13 11:47:19,800 INFO L281 TraceCheckUtils]: 2: Hoare triple {2463#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2463#true} is VALID [2021-09-13 11:47:19,800 INFO L281 TraceCheckUtils]: 1: Hoare triple {2463#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {2463#true} is VALID [2021-09-13 11:47:19,800 INFO L281 TraceCheckUtils]: 0: Hoare triple {2463#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7);call write~init~int(101, #t~string5.base, #t~string5.offset, 1);call write~init~int(113, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(110, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(52, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(46, #t~string5.base, 4 + #t~string5.offset, 1);call write~init~int(99, #t~string5.base, 5 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 6 + #t~string5.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~N~0 := 0; {2463#true} is VALID [2021-09-13 11:47:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 11:47:19,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:47:19,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076379395] [2021-09-13 11:47:19,801 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:47:19,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741535633] [2021-09-13 11:47:19,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741535633] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:47:19,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:47:19,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-09-13 11:47:19,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426682537] [2021-09-13 11:47:19,802 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-09-13 11:47:19,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:47:19,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:19,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:47:19,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-09-13 11:47:19,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 11:47:19,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-09-13 11:47:19,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-09-13 11:47:19,839 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:47:26,117 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2021-09-13 11:47:26,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 11:47:26,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-09-13 11:47:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:47:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2021-09-13 11:47:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2021-09-13 11:47:26,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2021-09-13 11:47:26,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:47:26,195 INFO L225 Difference]: With dead ends: 93 [2021-09-13 11:47:26,196 INFO L226 Difference]: Without dead ends: 72 [2021-09-13 11:47:26,196 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2430.36ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-09-13 11:47:26,197 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2465.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.05ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2468.67ms IncrementalHoareTripleChecker+Time [2021-09-13 11:47:26,197 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 172 Unknown, 0 Unchecked, 3.05ms Time], IncrementalHoareTripleChecker [25 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 2468.67ms Time] [2021-09-13 11:47:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-09-13 11:47:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2021-09-13 11:47:26,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:47:26,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:26,292 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:26,292 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:47:26,293 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2021-09-13 11:47:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2021-09-13 11:47:26,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:47:26,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:47:26,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2021-09-13 11:47:26,294 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2021-09-13 11:47:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:47:26,296 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2021-09-13 11:47:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2021-09-13 11:47:26,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:47:26,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:47:26,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:47:26,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:47:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2021-09-13 11:47:26,298 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 24 [2021-09-13 11:47:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:47:26,298 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2021-09-13 11:47:26,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2021-09-13 11:47:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-13 11:47:26,299 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:47:26,299 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:47:26,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-09-13 11:47:26,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-09-13 11:47:26,525 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:47:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:47:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1232945932, now seen corresponding path program 3 times [2021-09-13 11:47:26,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 11:47:26,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099319015] [2021-09-13 11:47:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:47:26,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 11:47:26,539 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 11:47:26,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109927313] [2021-09-13 11:47:26,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 11:47:26,539 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:47:26,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:47:26,547 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:47:26,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-09-13 11:47:26,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-09-13 11:47:26,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 11:47:26,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 35 conjunts are in the unsatisfiable core [2021-09-13 11:47:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:47:26,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:47:27,031 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-09-13 11:47:27,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-09-13 11:47:27,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-09-13 11:47:31,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:31,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:31,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:31,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:31,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:31,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:31,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:31,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:31,363 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-09-13 11:47:31,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 304 [2021-09-13 11:47:32,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:32,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 62 [2021-09-13 11:47:32,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:32,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,380 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-09-13 11:47:32,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 163 treesize of output 91 [2021-09-13 11:47:32,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:32,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:32,573 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-09-13 11:47:32,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 67 [2021-09-13 11:47:37,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:37,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:37,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:37,501 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-09-13 11:47:37,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 46 [2021-09-13 11:47:42,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:42,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:42,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:42,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:42,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:42,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:42,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:43,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:43,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:43,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:43,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:43,580 INFO L354 Elim1Store]: treesize reduction 86, result has 18.1 percent of original size [2021-09-13 11:47:43,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 30 case distinctions, treesize of input 254 treesize of output 506 [2021-09-13 11:47:45,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:45,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:45,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,256 INFO L244 Elim1Store]: Index analysis took 207 ms [2021-09-13 11:47:45,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 10 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 159 [2021-09-13 11:47:45,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:45,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:45,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,669 INFO L244 Elim1Store]: Index analysis took 236 ms [2021-09-13 11:47:45,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:45,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:45,757 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-09-13 11:47:45,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 300 treesize of output 179 [2021-09-13 11:47:45,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:46,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,180 INFO L244 Elim1Store]: Index analysis took 199 ms [2021-09-13 11:47:46,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:46,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:46,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:46,231 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-09-13 11:47:46,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 196 treesize of output 88 [2021-09-13 11:47:50,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-09-13 11:47:50,099 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-09-13 11:47:50,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 11:47:50,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099319015] [2021-09-13 11:47:50,100 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:47:50,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109927313] [2021-09-13 11:47:50,100 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-09-13 11:47:50,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-09-13 11:47:50,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-09-13 11:47:50,100 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-09-13 11:47:50,100 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-09-13 11:47:50,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 11:47:50,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-09-13 11:47:50,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-09-13 11:47:50,309 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 11:47:50,320 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 11:47:50,320 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 11:47:50,320 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2021-09-13 11:47:50,321 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2021-09-13 11:47:50,322 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2021-09-13 11:47:50,323 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2021-09-13 11:47:50,323 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2021-09-13 11:47:50,323 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2021-09-13 11:47:50,323 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2021-09-13 11:47:50,323 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2021-09-13 11:47:50,323 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2021-09-13 11:47:50,323 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 11:47:50,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 11:47:50 BoogieIcfgContainer [2021-09-13 11:47:50,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 11:47:50,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 11:47:50,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 11:47:50,325 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 11:47:50,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:40:52" (3/4) ... [2021-09-13 11:47:50,327 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-09-13 11:47:50,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 11:47:50,328 INFO L158 Benchmark]: Toolchain (without parser) took 418386.02ms. Allocated memory was 52.4MB in the beginning and 83.9MB in the end (delta: 31.5MB). Free memory was 28.8MB in the beginning and 32.3MB in the end (delta: -3.5MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2021-09-13 11:47:50,329 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 33.4MB in the beginning and 33.4MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 11:47:50,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.51ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.7MB in the beginning and 46.2MB in the end (delta: -17.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 11:47:50,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.54ms. Allocated memory is still 62.9MB. Free memory was 46.0MB in the beginning and 44.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 11:47:50,330 INFO L158 Benchmark]: Boogie Preprocessor took 49.10ms. Allocated memory is still 62.9MB. Free memory was 44.0MB in the beginning and 42.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 11:47:50,330 INFO L158 Benchmark]: RCFGBuilder took 467.73ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 30.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 11:47:50,330 INFO L158 Benchmark]: TraceAbstraction took 417590.58ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 29.5MB in the beginning and 33.2MB in the end (delta: -3.7MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2021-09-13 11:47:50,330 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 83.9MB. Free memory is still 32.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 11:47:50,332 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 33.4MB in the beginning and 33.4MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.51ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.7MB in the beginning and 46.2MB in the end (delta: -17.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.54ms. Allocated memory is still 62.9MB. Free memory was 46.0MB in the beginning and 44.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.10ms. Allocated memory is still 62.9MB. Free memory was 44.0MB in the beginning and 42.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 467.73ms. Allocated memory is still 62.9MB. Free memory was 42.5MB in the beginning and 30.0MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 417590.58ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 29.5MB in the beginning and 33.2MB in the end (delta: -3.7MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 83.9MB. Free memory is still 32.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 15]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L13] COND FALSE !(!cond) [L27] long long i; [L28] long long *a = malloc(sizeof(long long)*N); [L29] long long *b = malloc(sizeof(long long)*N); [L31] a[0] = 8 [L32] b[0] = 1 [L33] i=1 [L33] COND TRUE i 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30192b5b0c1eb564e0de6a5c7a5fdad0c55c7aa4 [2021-09-13 11:47:52,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 11:47:52,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 11:47:52,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 11:47:52,389 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 11:47:52,391 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 11:47:52,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/eqn4.c [2021-09-13 11:47:52,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae2dd532/0885942a18c24dc4a6c1f05417599692/FLAG72c85a2f0 [2021-09-13 11:47:52,844 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 11:47:52,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/eqn4.c [2021-09-13 11:47:52,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae2dd532/0885942a18c24dc4a6c1f05417599692/FLAG72c85a2f0 [2021-09-13 11:47:52,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ae2dd532/0885942a18c24dc4a6c1f05417599692 [2021-09-13 11:47:52,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 11:47:52,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 11:47:52,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 11:47:52,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 11:47:52,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 11:47:52,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:47:52" (1/1) ... [2021-09-13 11:47:52,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa81046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:52, skipping insertion in model container [2021-09-13 11:47:52,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:47:52" (1/1) ... [2021-09-13 11:47:52,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 11:47:52,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 11:47:53,076 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/eqn4.c[587,600] [2021-09-13 11:47:53,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 11:47:53,106 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 11:47:53,130 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/eqn4.c[587,600] [2021-09-13 11:47:53,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 11:47:53,175 INFO L208 MainTranslator]: Completed translation [2021-09-13 11:47:53,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53 WrapperNode [2021-09-13 11:47:53,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 11:47:53,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 11:47:53,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 11:47:53,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 11:47:53,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 11:47:53,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 11:47:53,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 11:47:53,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 11:47:53,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 11:47:53,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 11:47:53,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 11:47:53,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 11:47:53,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (1/1) ... [2021-09-13 11:47:53,284 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 11:47:53,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:47:53,310 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) [2021-09-13 11:47:53,325 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 [2021-09-13 11:47:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 11:47:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 11:47:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-09-13 11:47:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-09-13 11:47:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 11:47:53,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 11:47:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-09-13 11:47:53,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 11:47:53,935 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-09-13 11:47:53,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:47:53 BoogieIcfgContainer [2021-09-13 11:47:53,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 11:47:53,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 11:47:53,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 11:47:53,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 11:47:53,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 11:47:52" (1/3) ... [2021-09-13 11:47:53,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f9e26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:47:53, skipping insertion in model container [2021-09-13 11:47:53,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:53" (2/3) ... [2021-09-13 11:47:53,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f9e26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:47:53, skipping insertion in model container [2021-09-13 11:47:53,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:47:53" (3/3) ... [2021-09-13 11:47:53,946 INFO L111 eAbstractionObserver]: Analyzing ICFG eqn4.c [2021-09-13 11:47:53,951 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 11:47:53,951 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 11:47:54,003 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 11:47:54,013 INFO L339 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=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 11:47:54,013 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 11:47:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 11:47:54,036 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:47:54,037 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:47:54,038 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:47:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:47:54,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2021-09-13 11:47:54,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 11:47:54,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111925820] [2021-09-13 11:47:54,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:47:54,057 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 11:47:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 11:47:54,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 11:47:54,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-09-13 11:47:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:47:54,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 11:47:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:47:54,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:47:54,290 INFO L281 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {24#true} is VALID [2021-09-13 11:47:54,291 INFO L281 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {24#true} is VALID [2021-09-13 11:47:54,291 INFO L281 TraceCheckUtils]: 2: Hoare triple {24#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {24#true} is VALID [2021-09-13 11:47:54,292 INFO L281 TraceCheckUtils]: 3: Hoare triple {24#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2021-09-13 11:47:54,292 INFO L281 TraceCheckUtils]: 4: Hoare triple {25#false} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {25#false} is VALID [2021-09-13 11:47:54,292 INFO L281 TraceCheckUtils]: 5: Hoare triple {25#false} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {25#false} is VALID [2021-09-13 11:47:54,293 INFO L281 TraceCheckUtils]: 6: Hoare triple {25#false} main_~i~0 := ~sign_extendFrom32To64(1bv32); {25#false} is VALID [2021-09-13 11:47:54,293 INFO L281 TraceCheckUtils]: 7: Hoare triple {25#false} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {25#false} is VALID [2021-09-13 11:47:54,293 INFO L281 TraceCheckUtils]: 8: Hoare triple {25#false} main_~i~0 := ~sign_extendFrom32To64(0bv32); {25#false} is VALID [2021-09-13 11:47:54,293 INFO L281 TraceCheckUtils]: 9: Hoare triple {25#false} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {25#false} is VALID [2021-09-13 11:47:54,294 INFO L281 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0bv32 == __VERIFIER_assert_~cond; {25#false} is VALID [2021-09-13 11:47:54,294 INFO L281 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2021-09-13 11:47:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:47:54,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:47:54,374 INFO L281 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2021-09-13 11:47:54,374 INFO L281 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0bv32 == __VERIFIER_assert_~cond; {25#false} is VALID [2021-09-13 11:47:54,375 INFO L281 TraceCheckUtils]: 9: Hoare triple {25#false} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {25#false} is VALID [2021-09-13 11:47:54,375 INFO L281 TraceCheckUtils]: 8: Hoare triple {25#false} main_~i~0 := ~sign_extendFrom32To64(0bv32); {25#false} is VALID [2021-09-13 11:47:54,376 INFO L281 TraceCheckUtils]: 7: Hoare triple {25#false} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {25#false} is VALID [2021-09-13 11:47:54,376 INFO L281 TraceCheckUtils]: 6: Hoare triple {25#false} main_~i~0 := ~sign_extendFrom32To64(1bv32); {25#false} is VALID [2021-09-13 11:47:54,376 INFO L281 TraceCheckUtils]: 5: Hoare triple {25#false} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {25#false} is VALID [2021-09-13 11:47:54,376 INFO L281 TraceCheckUtils]: 4: Hoare triple {25#false} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {25#false} is VALID [2021-09-13 11:47:54,377 INFO L281 TraceCheckUtils]: 3: Hoare triple {24#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2021-09-13 11:47:54,378 INFO L281 TraceCheckUtils]: 2: Hoare triple {24#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {24#true} is VALID [2021-09-13 11:47:54,378 INFO L281 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {24#true} is VALID [2021-09-13 11:47:54,378 INFO L281 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {24#true} is VALID [2021-09-13 11:47:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:47:54,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 11:47:54,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111925820] [2021-09-13 11:47:54,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111925820] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 11:47:54,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 11:47:54,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 11:47:54,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6488445] [2021-09-13 11:47:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-09-13 11:47:54,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:47:54,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:54,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:47:54,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 11:47:54,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 11:47:54,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 11:47:54,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 11:47:54,467 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:47:54,713 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-09-13 11:47:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 11:47:54,714 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-09-13 11:47:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:47:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2021-09-13 11:47:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2021-09-13 11:47:54,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2021-09-13 11:47:54,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:47:54,889 INFO L225 Difference]: With dead ends: 38 [2021-09-13 11:47:54,890 INFO L226 Difference]: Without dead ends: 17 [2021-09-13 11:47:54,892 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.20ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 11:47:54,895 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.76ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 99.35ms IncrementalHoareTripleChecker+Time [2021-09-13 11:47:54,897 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.76ms Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 99.35ms Time] [2021-09-13 11:47:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-09-13 11:47:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-09-13 11:47:54,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:47:54,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) [2021-09-13 11:47:54,921 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) [2021-09-13 11:47:54,922 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) [2021-09-13 11:47:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:47:54,925 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-09-13 11:47:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 11:47:54,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:47:54,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:47:54,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) Second operand 17 states. [2021-09-13 11:47:54,926 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) Second operand 17 states. [2021-09-13 11:47:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:47:54,927 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-09-13 11:47:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 11:47:54,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:47:54,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:47:54,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:47:54,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:47:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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) [2021-09-13 11:47:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-09-13 11:47:54,930 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2021-09-13 11:47:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:47:54,931 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-09-13 11:47:54,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:47:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 11:47:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 11:47:54,931 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:47:54,932 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:47:54,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-09-13 11:47:55,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 11:47:55,133 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:47:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:47:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2021-09-13 11:47:55,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 11:47:55,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951383575] [2021-09-13 11:47:55,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:47:55,135 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 11:47:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 11:47:55,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 11:47:55,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-09-13 11:47:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:47:55,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 11:47:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:47:55,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:47:55,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:55,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:55,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:55,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:55,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:55,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:55,551 INFO L354 Elim1Store]: treesize reduction 152, result has 24.0 percent of original size [2021-09-13 11:47:55,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 68 [2021-09-13 11:47:59,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:59,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:47:59,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:47:59,969 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-09-13 11:47:59,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 65 [2021-09-13 11:48:00,005 INFO L281 TraceCheckUtils]: 0: Hoare triple {194#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {194#true} is VALID [2021-09-13 11:48:00,005 INFO L281 TraceCheckUtils]: 1: Hoare triple {194#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {194#true} is VALID [2021-09-13 11:48:00,006 INFO L281 TraceCheckUtils]: 2: Hoare triple {194#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {194#true} is VALID [2021-09-13 11:48:00,006 INFO L281 TraceCheckUtils]: 3: Hoare triple {194#true} assume !(0bv32 == assume_abort_if_not_~cond); {194#true} is VALID [2021-09-13 11:48:00,010 INFO L281 TraceCheckUtils]: 4: Hoare triple {194#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {211#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:00,011 INFO L281 TraceCheckUtils]: 5: Hoare triple {211#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {211#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:00,011 INFO L281 TraceCheckUtils]: 6: Hoare triple {211#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {211#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:00,012 INFO L281 TraceCheckUtils]: 7: Hoare triple {211#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {211#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:00,013 INFO L281 TraceCheckUtils]: 8: Hoare triple {211#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} main_~i~0 := ~sign_extendFrom32To64(0bv32); {224#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:48:00,014 INFO L281 TraceCheckUtils]: 9: Hoare triple {224#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {228#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 11:48:00,014 INFO L281 TraceCheckUtils]: 10: Hoare triple {228#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {195#false} is VALID [2021-09-13 11:48:00,015 INFO L281 TraceCheckUtils]: 11: Hoare triple {195#false} assume !false; {195#false} is VALID [2021-09-13 11:48:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:00,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:48:01,066 INFO L281 TraceCheckUtils]: 11: Hoare triple {195#false} assume !false; {195#false} is VALID [2021-09-13 11:48:01,067 INFO L281 TraceCheckUtils]: 10: Hoare triple {238#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {195#false} is VALID [2021-09-13 11:48:02,939 INFO L281 TraceCheckUtils]: 9: Hoare triple {242#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {238#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 11:48:02,941 INFO L281 TraceCheckUtils]: 8: Hoare triple {246#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} main_~i~0 := ~sign_extendFrom32To64(0bv32); {242#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))} is VALID [2021-09-13 11:48:02,941 INFO L281 TraceCheckUtils]: 7: Hoare triple {246#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {246#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:02,941 INFO L281 TraceCheckUtils]: 6: Hoare triple {246#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {246#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:02,942 INFO L281 TraceCheckUtils]: 5: Hoare triple {246#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {246#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:02,945 INFO L281 TraceCheckUtils]: 4: Hoare triple {194#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {246#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:02,946 INFO L281 TraceCheckUtils]: 3: Hoare triple {194#true} assume !(0bv32 == assume_abort_if_not_~cond); {194#true} is VALID [2021-09-13 11:48:02,946 INFO L281 TraceCheckUtils]: 2: Hoare triple {194#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {194#true} is VALID [2021-09-13 11:48:02,946 INFO L281 TraceCheckUtils]: 1: Hoare triple {194#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {194#true} is VALID [2021-09-13 11:48:02,946 INFO L281 TraceCheckUtils]: 0: Hoare triple {194#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {194#true} is VALID [2021-09-13 11:48:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:02,947 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 11:48:02,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951383575] [2021-09-13 11:48:02,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951383575] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 11:48:02,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 11:48:02,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-09-13 11:48:02,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103808437] [2021-09-13 11:48:02,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) 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 12 [2021-09-13 11:48:02,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:48:02,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) 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) [2021-09-13 11:48:05,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:05,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 11:48:05,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 11:48:05,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 11:48:05,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-09-13 11:48:05,048 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 8 states have (on average 2.375) 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) [2021-09-13 11:48:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:08,997 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-09-13 11:48:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 11:48:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) 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 12 [2021-09-13 11:48:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:48:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) 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) [2021-09-13 11:48:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2021-09-13 11:48:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) 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) [2021-09-13 11:48:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2021-09-13 11:48:09,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2021-09-13 11:48:09,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:09,147 INFO L225 Difference]: With dead ends: 35 [2021-09-13 11:48:09,147 INFO L226 Difference]: Without dead ends: 33 [2021-09-13 11:48:09,148 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 916.22ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-09-13 11:48:09,154 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1824.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.36ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1829.31ms IncrementalHoareTripleChecker+Time [2021-09-13 11:48:09,155 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 125 Unknown, 0 Unchecked, 3.36ms Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1829.31ms Time] [2021-09-13 11:48:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-09-13 11:48:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2021-09-13 11:48:09,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:48:09,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:09,166 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:09,166 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:09,168 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-09-13 11:48:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-09-13 11:48:09,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:09,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:09,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2021-09-13 11:48:09,182 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2021-09-13 11:48:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:09,186 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-09-13 11:48:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-09-13 11:48:09,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:09,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:09,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:48:09,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:48:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-09-13 11:48:09,189 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2021-09-13 11:48:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:48:09,190 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-09-13 11:48:09,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) 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) [2021-09-13 11:48:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-09-13 11:48:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 11:48:09,192 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:48:09,194 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:48:09,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-09-13 11:48:09,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 11:48:09,405 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:48:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:48:09,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1755224028, now seen corresponding path program 1 times [2021-09-13 11:48:09,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 11:48:09,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213600583] [2021-09-13 11:48:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:48:09,407 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 11:48:09,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 11:48:09,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 11:48:09,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-09-13 11:48:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:09,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 11:48:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:09,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:48:09,784 INFO L281 TraceCheckUtils]: 0: Hoare triple {415#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {415#true} is VALID [2021-09-13 11:48:09,784 INFO L281 TraceCheckUtils]: 1: Hoare triple {415#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {415#true} is VALID [2021-09-13 11:48:09,789 INFO L281 TraceCheckUtils]: 2: Hoare triple {415#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {426#(and (or (and (not (bvsle ~N~0 (_ bv536870911 32))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ~N~0 (_ bv536870911 32)))) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:09,790 INFO L281 TraceCheckUtils]: 3: Hoare triple {426#(and (or (and (not (bvsle ~N~0 (_ bv536870911 32))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ~N~0 (_ bv536870911 32)))) (not (bvsle ~N~0 (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {430#(and (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:09,791 INFO L281 TraceCheckUtils]: 4: Hoare triple {430#(and (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {434#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:09,794 INFO L281 TraceCheckUtils]: 5: Hoare triple {434#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {438#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:09,794 INFO L281 TraceCheckUtils]: 6: Hoare triple {438#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {442#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:09,795 INFO L281 TraceCheckUtils]: 7: Hoare triple {442#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem13 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call main_#t~mem14 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem13, main_#t~mem14), main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem13;havoc main_#t~mem14; {416#false} is VALID [2021-09-13 11:48:09,795 INFO L281 TraceCheckUtils]: 8: Hoare triple {416#false} main_#t~post12 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post12);havoc main_#t~post12; {416#false} is VALID [2021-09-13 11:48:09,795 INFO L281 TraceCheckUtils]: 9: Hoare triple {416#false} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {416#false} is VALID [2021-09-13 11:48:09,796 INFO L281 TraceCheckUtils]: 10: Hoare triple {416#false} main_~i~0 := ~sign_extendFrom32To64(0bv32); {416#false} is VALID [2021-09-13 11:48:09,796 INFO L281 TraceCheckUtils]: 11: Hoare triple {416#false} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {416#false} is VALID [2021-09-13 11:48:09,796 INFO L281 TraceCheckUtils]: 12: Hoare triple {416#false} assume 0bv32 == __VERIFIER_assert_~cond; {416#false} is VALID [2021-09-13 11:48:09,796 INFO L281 TraceCheckUtils]: 13: Hoare triple {416#false} assume !false; {416#false} is VALID [2021-09-13 11:48:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:09,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:48:09,921 INFO L281 TraceCheckUtils]: 13: Hoare triple {416#false} assume !false; {416#false} is VALID [2021-09-13 11:48:09,922 INFO L281 TraceCheckUtils]: 12: Hoare triple {416#false} assume 0bv32 == __VERIFIER_assert_~cond; {416#false} is VALID [2021-09-13 11:48:09,922 INFO L281 TraceCheckUtils]: 11: Hoare triple {416#false} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {416#false} is VALID [2021-09-13 11:48:09,922 INFO L281 TraceCheckUtils]: 10: Hoare triple {416#false} main_~i~0 := ~sign_extendFrom32To64(0bv32); {416#false} is VALID [2021-09-13 11:48:09,922 INFO L281 TraceCheckUtils]: 9: Hoare triple {416#false} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {416#false} is VALID [2021-09-13 11:48:09,922 INFO L281 TraceCheckUtils]: 8: Hoare triple {416#false} main_#t~post12 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post12);havoc main_#t~post12; {416#false} is VALID [2021-09-13 11:48:09,923 INFO L281 TraceCheckUtils]: 7: Hoare triple {482#(not (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem13 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call main_#t~mem14 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem13, main_#t~mem14), main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem13;havoc main_#t~mem14; {416#false} is VALID [2021-09-13 11:48:09,924 INFO L281 TraceCheckUtils]: 6: Hoare triple {486#(not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {482#(not (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:09,924 INFO L281 TraceCheckUtils]: 5: Hoare triple {490#(or (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {486#(not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:09,925 INFO L281 TraceCheckUtils]: 4: Hoare triple {415#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {490#(or (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:09,926 INFO L281 TraceCheckUtils]: 3: Hoare triple {415#true} assume !(0bv32 == assume_abort_if_not_~cond); {415#true} is VALID [2021-09-13 11:48:09,926 INFO L281 TraceCheckUtils]: 2: Hoare triple {415#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {415#true} is VALID [2021-09-13 11:48:09,926 INFO L281 TraceCheckUtils]: 1: Hoare triple {415#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {415#true} is VALID [2021-09-13 11:48:09,926 INFO L281 TraceCheckUtils]: 0: Hoare triple {415#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {415#true} is VALID [2021-09-13 11:48:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:09,928 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 11:48:09,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213600583] [2021-09-13 11:48:09,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213600583] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 11:48:09,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 11:48:09,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2021-09-13 11:48:09,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952521581] [2021-09-13 11:48:09,931 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 11:48:09,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:48:09,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:10,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:10,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 11:48:10,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 11:48:10,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 11:48:10,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-09-13 11:48:10,003 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:11,180 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2021-09-13 11:48:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 11:48:11,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 11:48:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:48:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2021-09-13 11:48:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2021-09-13 11:48:11,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2021-09-13 11:48:11,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:11,328 INFO L225 Difference]: With dead ends: 43 [2021-09-13 11:48:11,328 INFO L226 Difference]: Without dead ends: 34 [2021-09-13 11:48:11,329 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 325.16ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-09-13 11:48:11,329 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 435.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.30ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 438.86ms IncrementalHoareTripleChecker+Time [2021-09-13 11:48:11,330 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 3.30ms Time], IncrementalHoareTripleChecker [22 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 438.86ms Time] [2021-09-13 11:48:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-09-13 11:48:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2021-09-13 11:48:11,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:48:11,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:11,346 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:11,346 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:11,347 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-09-13 11:48:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-09-13 11:48:11,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:11,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:11,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2021-09-13 11:48:11,348 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2021-09-13 11:48:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:11,350 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-09-13 11:48:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-09-13 11:48:11,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:11,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:11,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:48:11,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:48:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2021-09-13 11:48:11,352 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2021-09-13 11:48:11,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:48:11,352 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-09-13 11:48:11,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2021-09-13 11:48:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 11:48:11,353 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:48:11,353 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:48:11,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-09-13 11:48:11,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 11:48:11,565 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:48:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:48:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1842440164, now seen corresponding path program 1 times [2021-09-13 11:48:11,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 11:48:11,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443137482] [2021-09-13 11:48:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:48:11,566 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 11:48:11,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 11:48:11,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 11:48:11,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-09-13 11:48:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:11,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2021-09-13 11:48:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:11,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:48:12,004 INFO L281 TraceCheckUtils]: 0: Hoare triple {669#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {669#true} is VALID [2021-09-13 11:48:12,004 INFO L281 TraceCheckUtils]: 1: Hoare triple {669#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {669#true} is VALID [2021-09-13 11:48:12,005 INFO L281 TraceCheckUtils]: 2: Hoare triple {669#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {680#(and (or (and (not (bvsle ~N~0 (_ bv536870911 32))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ~N~0 (_ bv536870911 32)))) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:12,006 INFO L281 TraceCheckUtils]: 3: Hoare triple {680#(and (or (and (not (bvsle ~N~0 (_ bv536870911 32))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ~N~0 (_ bv536870911 32)))) (not (bvsle ~N~0 (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {684#(and (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:12,007 INFO L281 TraceCheckUtils]: 4: Hoare triple {684#(and (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {688#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:12,008 INFO L281 TraceCheckUtils]: 5: Hoare triple {688#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {692#(and (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:12,008 INFO L281 TraceCheckUtils]: 6: Hoare triple {692#(and (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvsle ~N~0 (_ bv536870911 32)))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {696#(and (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64))) (bvsle ~N~0 (_ bv536870911 32)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:12,009 INFO L281 TraceCheckUtils]: 7: Hoare triple {696#(and (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64))) (bvsle ~N~0 (_ bv536870911 32)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {700#(and (not (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0))) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:12,010 INFO L281 TraceCheckUtils]: 8: Hoare triple {700#(and (not (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0))) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {704#(and (not (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:12,010 INFO L281 TraceCheckUtils]: 9: Hoare triple {704#(and (not (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {670#false} is VALID [2021-09-13 11:48:12,010 INFO L281 TraceCheckUtils]: 10: Hoare triple {670#false} main_~i~0 := ~sign_extendFrom32To64(0bv32); {670#false} is VALID [2021-09-13 11:48:12,010 INFO L281 TraceCheckUtils]: 11: Hoare triple {670#false} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {670#false} is VALID [2021-09-13 11:48:12,011 INFO L281 TraceCheckUtils]: 12: Hoare triple {670#false} assume 0bv32 == __VERIFIER_assert_~cond; {670#false} is VALID [2021-09-13 11:48:12,011 INFO L281 TraceCheckUtils]: 13: Hoare triple {670#false} assume !false; {670#false} is VALID [2021-09-13 11:48:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:12,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:48:12,295 INFO L281 TraceCheckUtils]: 13: Hoare triple {670#false} assume !false; {670#false} is VALID [2021-09-13 11:48:12,295 INFO L281 TraceCheckUtils]: 12: Hoare triple {670#false} assume 0bv32 == __VERIFIER_assert_~cond; {670#false} is VALID [2021-09-13 11:48:12,295 INFO L281 TraceCheckUtils]: 11: Hoare triple {670#false} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {670#false} is VALID [2021-09-13 11:48:12,295 INFO L281 TraceCheckUtils]: 10: Hoare triple {670#false} main_~i~0 := ~sign_extendFrom32To64(0bv32); {670#false} is VALID [2021-09-13 11:48:12,296 INFO L281 TraceCheckUtils]: 9: Hoare triple {732#(bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {670#false} is VALID [2021-09-13 11:48:12,296 INFO L281 TraceCheckUtils]: 8: Hoare triple {736#(bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {732#(bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0))} is VALID [2021-09-13 11:48:12,297 INFO L281 TraceCheckUtils]: 7: Hoare triple {740#(or (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {736#(bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))} is VALID [2021-09-13 11:48:12,297 INFO L281 TraceCheckUtils]: 6: Hoare triple {744#(or (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {740#(or (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:12,298 INFO L281 TraceCheckUtils]: 5: Hoare triple {748#(or (not (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0))) (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {744#(or (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:12,298 INFO L281 TraceCheckUtils]: 4: Hoare triple {669#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {748#(or (not (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0))) (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:12,299 INFO L281 TraceCheckUtils]: 3: Hoare triple {669#true} assume !(0bv32 == assume_abort_if_not_~cond); {669#true} is VALID [2021-09-13 11:48:12,299 INFO L281 TraceCheckUtils]: 2: Hoare triple {669#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {669#true} is VALID [2021-09-13 11:48:12,299 INFO L281 TraceCheckUtils]: 1: Hoare triple {669#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {669#true} is VALID [2021-09-13 11:48:12,299 INFO L281 TraceCheckUtils]: 0: Hoare triple {669#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {669#true} is VALID [2021-09-13 11:48:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:12,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 11:48:12,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443137482] [2021-09-13 11:48:12,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443137482] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:48:12,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:48:12,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2021-09-13 11:48:12,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78748363] [2021-09-13 11:48:12,300 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 11:48:12,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:48:12,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:12,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:12,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 11:48:12,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 11:48:12,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 11:48:12,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-09-13 11:48:12,355 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:14,243 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2021-09-13 11:48:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-09-13 11:48:14,243 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 11:48:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:48:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2021-09-13 11:48:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 66 transitions. [2021-09-13 11:48:14,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 66 transitions. [2021-09-13 11:48:14,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:14,536 INFO L225 Difference]: With dead ends: 58 [2021-09-13 11:48:14,536 INFO L226 Difference]: Without dead ends: 49 [2021-09-13 11:48:14,537 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 667.08ms TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2021-09-13 11:48:14,538 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 690.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.20ms SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 694.23ms IncrementalHoareTripleChecker+Time [2021-09-13 11:48:14,538 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 204 Unknown, 0 Unchecked, 4.20ms Time], IncrementalHoareTripleChecker [56 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 694.23ms Time] [2021-09-13 11:48:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-09-13 11:48:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2021-09-13 11:48:14,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:48:14,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:14,558 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:14,558 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:14,564 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-09-13 11:48:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2021-09-13 11:48:14,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:14,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:14,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2021-09-13 11:48:14,565 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2021-09-13 11:48:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:14,567 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-09-13 11:48:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2021-09-13 11:48:14,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:14,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:14,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:48:14,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:48:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-09-13 11:48:14,569 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 14 [2021-09-13 11:48:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:48:14,570 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-09-13 11:48:14,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-09-13 11:48:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 11:48:14,571 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:48:14,571 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:48:14,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-09-13 11:48:14,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 11:48:14,783 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:48:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:48:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1667884396, now seen corresponding path program 1 times [2021-09-13 11:48:14,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 11:48:14,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771619814] [2021-09-13 11:48:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:48:14,784 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 11:48:14,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 11:48:14,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 11:48:14,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-09-13 11:48:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:15,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 11:48:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:15,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:48:15,379 INFO L281 TraceCheckUtils]: 0: Hoare triple {1001#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {1001#true} is VALID [2021-09-13 11:48:15,379 INFO L281 TraceCheckUtils]: 1: Hoare triple {1001#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1001#true} is VALID [2021-09-13 11:48:15,380 INFO L281 TraceCheckUtils]: 2: Hoare triple {1001#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1012#(and (or (and (not (bvsle ~N~0 (_ bv536870911 32))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ~N~0 (_ bv536870911 32)))) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:15,381 INFO L281 TraceCheckUtils]: 3: Hoare triple {1012#(and (or (and (not (bvsle ~N~0 (_ bv536870911 32))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ~N~0 (_ bv536870911 32)))) (not (bvsle ~N~0 (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {1016#(and (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:15,382 INFO L281 TraceCheckUtils]: 4: Hoare triple {1016#(and (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {1020#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:15,382 INFO L281 TraceCheckUtils]: 5: Hoare triple {1020#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1024#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:15,382 INFO L281 TraceCheckUtils]: 6: Hoare triple {1024#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {1024#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:15,383 INFO L281 TraceCheckUtils]: 7: Hoare triple {1024#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1024#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:15,383 INFO L281 TraceCheckUtils]: 8: Hoare triple {1024#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))))} main_~i~0 := ~sign_extendFrom32To64(0bv32); {1034#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:48:15,384 INFO L281 TraceCheckUtils]: 9: Hoare triple {1034#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1034#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:48:15,385 INFO L281 TraceCheckUtils]: 10: Hoare triple {1034#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {1034#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:48:15,385 INFO L281 TraceCheckUtils]: 11: Hoare triple {1034#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} havoc main_#t~mem16; {1034#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:48:15,386 INFO L281 TraceCheckUtils]: 12: Hoare triple {1034#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (not (bvsle ~N~0 (_ bv0 32))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} main_#t~post15 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post15);havoc main_#t~post15; {1047#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:15,396 INFO L281 TraceCheckUtils]: 13: Hoare triple {1047#(and (not (bvslt ((_ sign_extend 32) (_ bv1 32)) ((_ sign_extend 32) ~N~0))) (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (not (bvsle ~N~0 (_ bv0 32))))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1002#false} is VALID [2021-09-13 11:48:15,397 INFO L281 TraceCheckUtils]: 14: Hoare triple {1002#false} assume 0bv32 == __VERIFIER_assert_~cond; {1002#false} is VALID [2021-09-13 11:48:15,397 INFO L281 TraceCheckUtils]: 15: Hoare triple {1002#false} assume !false; {1002#false} is VALID [2021-09-13 11:48:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:15,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:48:15,543 INFO L281 TraceCheckUtils]: 15: Hoare triple {1002#false} assume !false; {1002#false} is VALID [2021-09-13 11:48:15,544 INFO L281 TraceCheckUtils]: 14: Hoare triple {1002#false} assume 0bv32 == __VERIFIER_assert_~cond; {1002#false} is VALID [2021-09-13 11:48:15,544 INFO L281 TraceCheckUtils]: 13: Hoare triple {1063#(not (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1002#false} is VALID [2021-09-13 11:48:15,545 INFO L281 TraceCheckUtils]: 12: Hoare triple {1067#(not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} main_#t~post15 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post15);havoc main_#t~post15; {1063#(not (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:15,546 INFO L281 TraceCheckUtils]: 11: Hoare triple {1067#(not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} havoc main_#t~mem16; {1067#(not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:15,546 INFO L281 TraceCheckUtils]: 10: Hoare triple {1067#(not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} assume !(0bv32 == __VERIFIER_assert_~cond); {1067#(not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:15,547 INFO L281 TraceCheckUtils]: 9: Hoare triple {1067#(not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1067#(not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:15,548 INFO L281 TraceCheckUtils]: 8: Hoare triple {1080#(not (bvslt (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} main_~i~0 := ~sign_extendFrom32To64(0bv32); {1067#(not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:15,548 INFO L281 TraceCheckUtils]: 7: Hoare triple {1080#(not (bvslt (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1080#(not (bvslt (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:15,548 INFO L281 TraceCheckUtils]: 6: Hoare triple {1080#(not (bvslt (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {1080#(not (bvslt (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:15,549 INFO L281 TraceCheckUtils]: 5: Hoare triple {1090#(or (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (not (bvslt (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1080#(not (bvslt (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:15,550 INFO L281 TraceCheckUtils]: 4: Hoare triple {1001#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {1090#(or (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (not (bvslt (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0))))} is VALID [2021-09-13 11:48:15,550 INFO L281 TraceCheckUtils]: 3: Hoare triple {1001#true} assume !(0bv32 == assume_abort_if_not_~cond); {1001#true} is VALID [2021-09-13 11:48:15,550 INFO L281 TraceCheckUtils]: 2: Hoare triple {1001#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1001#true} is VALID [2021-09-13 11:48:15,551 INFO L281 TraceCheckUtils]: 1: Hoare triple {1001#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1001#true} is VALID [2021-09-13 11:48:15,551 INFO L281 TraceCheckUtils]: 0: Hoare triple {1001#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {1001#true} is VALID [2021-09-13 11:48:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:15,551 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 11:48:15,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771619814] [2021-09-13 11:48:15,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771619814] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:48:15,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:48:15,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2021-09-13 11:48:15,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554792965] [2021-09-13 11:48:15,553 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 11:48:15,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:48:15,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:15,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:15,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 11:48:15,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 11:48:15,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 11:48:15,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-09-13 11:48:15,666 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:16,891 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-09-13 11:48:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 11:48:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 11:48:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:48:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2021-09-13 11:48:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2021-09-13 11:48:16,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2021-09-13 11:48:17,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:17,093 INFO L225 Difference]: With dead ends: 41 [2021-09-13 11:48:17,093 INFO L226 Difference]: Without dead ends: 27 [2021-09-13 11:48:17,094 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 336.77ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-09-13 11:48:17,095 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 521.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.05ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 523.93ms IncrementalHoareTripleChecker+Time [2021-09-13 11:48:17,095 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 2.05ms Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 523.93ms Time] [2021-09-13 11:48:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-09-13 11:48:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-09-13 11:48:17,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:48:17,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:17,111 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:17,111 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:17,112 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2021-09-13 11:48:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-09-13 11:48:17,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:17,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:17,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2021-09-13 11:48:17,113 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2021-09-13 11:48:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:17,114 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2021-09-13 11:48:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-09-13 11:48:17,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:17,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:17,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:48:17,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:48:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-09-13 11:48:17,116 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-09-13 11:48:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:48:17,116 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-09-13 11:48:17,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-09-13 11:48:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 11:48:17,117 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:48:17,117 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:48:17,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-09-13 11:48:17,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 11:48:17,329 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:48:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:48:17,330 INFO L82 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2021-09-13 11:48:17,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 11:48:17,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772719664] [2021-09-13 11:48:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:48:17,330 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 11:48:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 11:48:17,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 11:48:17,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-09-13 11:48:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:17,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 11:48:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:17,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:48:17,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-09-13 11:48:17,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:17,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:17,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:17,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:17,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:17,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:17,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:17,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2021-09-13 11:48:17,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:17,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:17,984 INFO L354 Elim1Store]: treesize reduction 883, result has 10.4 percent of original size [2021-09-13 11:48:17,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 22 case distinctions, treesize of input 132 treesize of output 141 [2021-09-13 11:48:19,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:19,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:19,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:19,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:19,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:19,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:19,300 INFO L354 Elim1Store]: treesize reduction 1444, result has 3.5 percent of original size [2021-09-13 11:48:19,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 70 case distinctions, treesize of input 290 treesize of output 247 [2021-09-13 11:48:26,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:26,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:26,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:26,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:26,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:26,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:26,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:26,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:26,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:26,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:26,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:26,838 INFO L354 Elim1Store]: treesize reduction 1186, result has 6.2 percent of original size [2021-09-13 11:48:26,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 363 treesize of output 203 [2021-09-13 11:48:26,922 INFO L281 TraceCheckUtils]: 0: Hoare triple {1259#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {1259#true} is VALID [2021-09-13 11:48:26,922 INFO L281 TraceCheckUtils]: 1: Hoare triple {1259#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1259#true} is VALID [2021-09-13 11:48:26,922 INFO L281 TraceCheckUtils]: 2: Hoare triple {1259#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1259#true} is VALID [2021-09-13 11:48:26,922 INFO L281 TraceCheckUtils]: 3: Hoare triple {1259#true} assume !(0bv32 == assume_abort_if_not_~cond); {1259#true} is VALID [2021-09-13 11:48:26,926 INFO L281 TraceCheckUtils]: 4: Hoare triple {1259#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {1276#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))))} is VALID [2021-09-13 11:48:27,038 INFO L281 TraceCheckUtils]: 5: Hoare triple {1276#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {1280#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (and (or (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))} is VALID [2021-09-13 11:48:27,039 INFO L281 TraceCheckUtils]: 6: Hoare triple {1280#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (and (or (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {1280#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (and (or (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))} is VALID [2021-09-13 11:48:27,040 INFO L281 TraceCheckUtils]: 7: Hoare triple {1280#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (and (or (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1280#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (and (or (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))} is VALID [2021-09-13 11:48:27,041 INFO L281 TraceCheckUtils]: 8: Hoare triple {1280#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (and (or (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {1290#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (and (or (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:48:29,046 INFO L281 TraceCheckUtils]: 9: Hoare triple {1290#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (and (or (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) ULTIMATE.start_main_~i~0)) (_ bv0 32))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem13 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call main_#t~mem14 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem13, main_#t~mem14), main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem13;havoc main_#t~mem14; {1294#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((v_ULTIMATE.start_main_~i~0_39 (_ BitVec 64)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32)))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} is UNKNOWN [2021-09-13 11:48:29,047 INFO L281 TraceCheckUtils]: 10: Hoare triple {1294#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((v_ULTIMATE.start_main_~i~0_39 (_ BitVec 64)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32)))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} main_#t~post12 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post12);havoc main_#t~post12; {1294#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((v_ULTIMATE.start_main_~i~0_39 (_ BitVec 64)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32)))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:29,050 INFO L281 TraceCheckUtils]: 11: Hoare triple {1294#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((v_ULTIMATE.start_main_~i~0_39 (_ BitVec 64)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32)))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1294#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((v_ULTIMATE.start_main_~i~0_39 (_ BitVec 64)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32)))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:29,052 INFO L281 TraceCheckUtils]: 12: Hoare triple {1294#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((v_ULTIMATE.start_main_~i~0_39 (_ BitVec 64)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32)))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))))} main_~i~0 := ~sign_extendFrom32To64(0bv32); {1304#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((v_ULTIMATE.start_main_~i~0_39 (_ BitVec 64)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32)))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:48:29,053 INFO L281 TraceCheckUtils]: 13: Hoare triple {1304#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((v_ULTIMATE.start_main_~i~0_39 (_ BitVec 64)) (ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (not (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~b~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32))))) (or (= (bvmul (_ bv8 32) ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39)) (_ bv0 32)) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32)))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) v_ULTIMATE.start_main_~i~0_39)) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) v_ULTIMATE.start_main_~i~0_39) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1308#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 11:48:29,053 INFO L281 TraceCheckUtils]: 14: Hoare triple {1308#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1260#false} is VALID [2021-09-13 11:48:29,053 INFO L281 TraceCheckUtils]: 15: Hoare triple {1260#false} assume !false; {1260#false} is VALID [2021-09-13 11:48:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:29,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:48:38,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (let ((.cse2 ((_ sign_extend 32) (_ bv0 32))) (.cse0 ((_ sign_extend 32) (_ bv1 32)))) (= (let ((.cse1 ((_ sign_extend 32) (_ bv4 32)))) (bvadd .cse0 (bvmul .cse1 .cse2 .cse2) (bvmul .cse1 .cse2))) (let ((.cse3 (select (store |c_#memory_int| c_ULTIMATE.start_main_~a~0.base (let ((.cse5 (select |c_#memory_int| c_ULTIMATE.start_main_~a~0.base))) (let ((.cse6 (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32))) (.cse7 (bvadd ((_ sign_extend 32) (_ bv8 32)) (let ((.cse8 (bvmul ((_ extract 31 0) (bvadd (bvneg .cse0) ULTIMATE.start_main_~i~0)) (_ bv8 32)))) (concat (select .cse5 (bvadd .cse8 (_ bv4 32) c_ULTIMATE.start_main_~a~0.offset)) (select .cse5 (bvadd .cse8 c_ULTIMATE.start_main_~a~0.offset))))))) (store (store .cse5 (bvadd .cse6 c_ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) .cse7)) (bvadd (_ bv4 32) .cse6 c_ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) .cse7))))) c_ULTIMATE.start_main_~b~0.base)) (.cse4 (bvmul ((_ extract 31 0) .cse2) (_ bv8 32)))) (concat (select .cse3 (bvadd (_ bv4 32) .cse4 c_ULTIMATE.start_main_~b~0.offset)) (select .cse3 (bvadd .cse4 c_ULTIMATE.start_main_~b~0.offset))))))) is different from false [2021-09-13 11:48:38,655 INFO L281 TraceCheckUtils]: 15: Hoare triple {1260#false} assume !false; {1260#false} is VALID [2021-09-13 11:48:38,656 INFO L281 TraceCheckUtils]: 14: Hoare triple {1318#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1260#false} is VALID [2021-09-13 11:48:40,664 INFO L281 TraceCheckUtils]: 13: Hoare triple {1322#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1318#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is UNKNOWN [2021-09-13 11:48:40,665 INFO L281 TraceCheckUtils]: 12: Hoare triple {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} main_~i~0 := ~sign_extendFrom32To64(0bv32); {1322#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))} is VALID [2021-09-13 11:48:40,666 INFO L281 TraceCheckUtils]: 11: Hoare triple {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:40,666 INFO L281 TraceCheckUtils]: 10: Hoare triple {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} main_#t~post12 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post12);havoc main_#t~post12; {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:40,670 INFO L281 TraceCheckUtils]: 9: Hoare triple {1336#(= (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem13 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call main_#t~mem14 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem13, main_#t~mem14), main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem13;havoc main_#t~mem14; {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:40,671 INFO L281 TraceCheckUtils]: 8: Hoare triple {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {1336#(= (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2021-09-13 11:48:40,671 INFO L281 TraceCheckUtils]: 7: Hoare triple {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:40,684 INFO L281 TraceCheckUtils]: 6: Hoare triple {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:40,689 INFO L281 TraceCheckUtils]: 5: Hoare triple {1349#(forall ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {1326#(= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:48:40,693 INFO L281 TraceCheckUtils]: 4: Hoare triple {1259#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {1349#(forall ((ULTIMATE.start_main_~i~0 (_ BitVec 64))) (= (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))} is VALID [2021-09-13 11:48:40,693 INFO L281 TraceCheckUtils]: 3: Hoare triple {1259#true} assume !(0bv32 == assume_abort_if_not_~cond); {1259#true} is VALID [2021-09-13 11:48:40,693 INFO L281 TraceCheckUtils]: 2: Hoare triple {1259#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1259#true} is VALID [2021-09-13 11:48:40,693 INFO L281 TraceCheckUtils]: 1: Hoare triple {1259#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1259#true} is VALID [2021-09-13 11:48:40,693 INFO L281 TraceCheckUtils]: 0: Hoare triple {1259#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {1259#true} is VALID [2021-09-13 11:48:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-09-13 11:48:40,693 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 11:48:40,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772719664] [2021-09-13 11:48:40,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772719664] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:48:40,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:48:40,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-09-13 11:48:40,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137564309] [2021-09-13 11:48:40,694 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 11:48:40,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:48:40,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:45,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:45,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-09-13 11:48:45,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 11:48:45,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-09-13 11:48:45,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2021-09-13 11:48:45,031 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:48,964 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-09-13 11:48:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 11:48:48,965 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 11:48:48,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:48:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2021-09-13 11:48:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2021-09-13 11:48:48,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2021-09-13 11:48:51,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:51,392 INFO L225 Difference]: With dead ends: 34 [2021-09-13 11:48:51,392 INFO L226 Difference]: Without dead ends: 32 [2021-09-13 11:48:51,392 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 6118.19ms TimeCoverageRelationStatistics Valid=38, Invalid=120, Unknown=2, NotChecked=22, Total=182 [2021-09-13 11:48:51,394 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 600.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.79ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 602.07ms IncrementalHoareTripleChecker+Time [2021-09-13 11:48:51,394 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 102 Unknown, 0 Unchecked, 0.79ms Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 45 Unchecked, 602.07ms Time] [2021-09-13 11:48:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-09-13 11:48:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-09-13 11:48:51,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:48:51,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:51,431 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:51,431 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:51,432 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2021-09-13 11:48:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2021-09-13 11:48:51,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:51,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:51,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2021-09-13 11:48:51,433 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2021-09-13 11:48:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:51,434 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2021-09-13 11:48:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2021-09-13 11:48:51,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:51,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:51,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:48:51,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:48:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2021-09-13 11:48:51,436 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2021-09-13 11:48:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:48:51,436 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-09-13 11:48:51,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2021-09-13 11:48:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 11:48:51,437 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:48:51,438 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:48:51,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-09-13 11:48:51,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 11:48:51,643 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:48:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:48:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1174519208, now seen corresponding path program 2 times [2021-09-13 11:48:51,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 11:48:51,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703214607] [2021-09-13 11:48:51,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 11:48:51,644 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 11:48:51,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 11:48:51,645 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 11:48:51,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-09-13 11:48:51,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 11:48:51,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 11:48:51,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 11:48:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:51,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:48:52,409 INFO L281 TraceCheckUtils]: 0: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {1512#true} is VALID [2021-09-13 11:48:52,410 INFO L281 TraceCheckUtils]: 1: Hoare triple {1512#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1512#true} is VALID [2021-09-13 11:48:52,412 INFO L281 TraceCheckUtils]: 2: Hoare triple {1512#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1523#(and (or (and (not (bvsle ~N~0 (_ bv536870911 32))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ~N~0 (_ bv536870911 32)))) (not (bvsle ~N~0 (_ bv0 32))))} is VALID [2021-09-13 11:48:52,413 INFO L281 TraceCheckUtils]: 3: Hoare triple {1523#(and (or (and (not (bvsle ~N~0 (_ bv536870911 32))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsle ~N~0 (_ bv536870911 32)))) (not (bvsle ~N~0 (_ bv0 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {1527#(and (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:52,414 INFO L281 TraceCheckUtils]: 4: Hoare triple {1527#(and (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {1531#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:52,414 INFO L281 TraceCheckUtils]: 5: Hoare triple {1531#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (not (bvsle ~N~0 (_ bv0 32))) (bvsle ~N~0 (_ bv536870911 32)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {1535#(and (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:52,415 INFO L281 TraceCheckUtils]: 6: Hoare triple {1535#(and (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvsle ~N~0 (_ bv536870911 32)))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {1539#(and (bvslt (bvadd (_ bv18446744073709551615 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:52,416 INFO L281 TraceCheckUtils]: 7: Hoare triple {1539#(and (bvslt (bvadd (_ bv18446744073709551615 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64))) (bvsle ~N~0 (_ bv536870911 32)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {1543#(and (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:52,416 INFO L281 TraceCheckUtils]: 8: Hoare triple {1543#(and (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64))) (bvsle ~N~0 (_ bv536870911 32)))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {1547#(and (bvslt (bvadd (_ bv18446744073709551615 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (= ULTIMATE.start_main_~i~0 (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32)))) (bvsle ~N~0 (_ bv536870911 32)))} is VALID [2021-09-13 11:48:52,417 INFO L281 TraceCheckUtils]: 9: Hoare triple {1547#(and (bvslt (bvadd (_ bv18446744073709551615 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (= ULTIMATE.start_main_~i~0 (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32)))) (bvsle ~N~0 (_ bv536870911 32)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1551#(and (not (bvslt (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) ~N~0))) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:52,417 INFO L281 TraceCheckUtils]: 10: Hoare triple {1551#(and (not (bvslt (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) ~N~0))) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {1555#(and (not (bvslt (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) ~N~0))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:52,418 INFO L281 TraceCheckUtils]: 11: Hoare triple {1555#(and (not (bvslt (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) ~N~0))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem13 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call main_#t~mem14 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem13, main_#t~mem14), main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem13;havoc main_#t~mem14; {1555#(and (not (bvslt (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) ~N~0))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:52,419 INFO L281 TraceCheckUtils]: 12: Hoare triple {1555#(and (not (bvslt (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) ~N~0))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} main_#t~post12 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post12);havoc main_#t~post12; {1562#(and (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64))) (not (bvslt (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) ~N~0))) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:52,419 INFO L281 TraceCheckUtils]: 13: Hoare triple {1562#(and (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64))) (not (bvslt (bvadd (_ bv2 64) ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) ~N~0))) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1513#false} is VALID [2021-09-13 11:48:52,420 INFO L281 TraceCheckUtils]: 14: Hoare triple {1513#false} main_~i~0 := ~sign_extendFrom32To64(0bv32); {1513#false} is VALID [2021-09-13 11:48:52,420 INFO L281 TraceCheckUtils]: 15: Hoare triple {1513#false} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1513#false} is VALID [2021-09-13 11:48:52,420 INFO L281 TraceCheckUtils]: 16: Hoare triple {1513#false} assume 0bv32 == __VERIFIER_assert_~cond; {1513#false} is VALID [2021-09-13 11:48:52,420 INFO L281 TraceCheckUtils]: 17: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2021-09-13 11:48:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:52,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:48:52,820 INFO L281 TraceCheckUtils]: 17: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2021-09-13 11:48:52,820 INFO L281 TraceCheckUtils]: 16: Hoare triple {1513#false} assume 0bv32 == __VERIFIER_assert_~cond; {1513#false} is VALID [2021-09-13 11:48:52,821 INFO L281 TraceCheckUtils]: 15: Hoare triple {1513#false} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1513#false} is VALID [2021-09-13 11:48:52,821 INFO L281 TraceCheckUtils]: 14: Hoare triple {1513#false} main_~i~0 := ~sign_extendFrom32To64(0bv32); {1513#false} is VALID [2021-09-13 11:48:52,821 INFO L281 TraceCheckUtils]: 13: Hoare triple {1590#(bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1513#false} is VALID [2021-09-13 11:48:52,859 INFO L281 TraceCheckUtils]: 12: Hoare triple {1594#(bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0))} main_#t~post12 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post12);havoc main_#t~post12; {1590#(bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0))} is VALID [2021-09-13 11:48:52,859 INFO L281 TraceCheckUtils]: 11: Hoare triple {1594#(bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem13 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call main_#t~mem14 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem13, main_#t~mem14), main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem13;havoc main_#t~mem14; {1594#(bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0))} is VALID [2021-09-13 11:48:52,860 INFO L281 TraceCheckUtils]: 10: Hoare triple {1601#(bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {1594#(bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0))} is VALID [2021-09-13 11:48:52,860 INFO L281 TraceCheckUtils]: 9: Hoare triple {1605#(or (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1601#(bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0))} is VALID [2021-09-13 11:48:52,861 INFO L281 TraceCheckUtils]: 8: Hoare triple {1609#(or (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {1605#(or (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0)) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:52,861 INFO L281 TraceCheckUtils]: 7: Hoare triple {1613#(or (not (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0))) (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {1609#(or (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:52,913 INFO L281 TraceCheckUtils]: 6: Hoare triple {1617#(or (not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0))) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)) (bvslt (bvadd (_ bv2 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {1613#(or (not (bvslt ULTIMATE.start_main_~i~0 ((_ sign_extend 32) ~N~0))) (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:52,913 INFO L281 TraceCheckUtils]: 5: Hoare triple {1617#(or (not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0))) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)) (bvslt (bvadd (_ bv2 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {1617#(or (not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0))) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)) (bvslt (bvadd (_ bv2 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:52,914 INFO L281 TraceCheckUtils]: 4: Hoare triple {1512#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {1617#(or (not (bvslt (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0))) (bvslt (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) ((_ sign_extend 32) ~N~0)) (bvslt (bvadd (_ bv2 64) ULTIMATE.start_main_~i~0) ((_ sign_extend 32) ~N~0)))} is VALID [2021-09-13 11:48:52,914 INFO L281 TraceCheckUtils]: 3: Hoare triple {1512#true} assume !(0bv32 == assume_abort_if_not_~cond); {1512#true} is VALID [2021-09-13 11:48:52,914 INFO L281 TraceCheckUtils]: 2: Hoare triple {1512#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1512#true} is VALID [2021-09-13 11:48:52,915 INFO L281 TraceCheckUtils]: 1: Hoare triple {1512#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1512#true} is VALID [2021-09-13 11:48:52,915 INFO L281 TraceCheckUtils]: 0: Hoare triple {1512#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {1512#true} is VALID [2021-09-13 11:48:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:48:52,915 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 11:48:52,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703214607] [2021-09-13 11:48:52,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703214607] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:48:52,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:48:52,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2021-09-13 11:48:52,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103404129] [2021-09-13 11:48:52,916 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-13 11:48:52,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:48:52,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:53,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:53,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-09-13 11:48:53,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 11:48:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-09-13 11:48:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-09-13 11:48:53,075 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:56,656 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2021-09-13 11:48:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-09-13 11:48:56,656 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-13 11:48:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:48:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2021-09-13 11:48:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 90 transitions. [2021-09-13 11:48:56,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 90 transitions. [2021-09-13 11:48:57,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:48:57,080 INFO L225 Difference]: With dead ends: 81 [2021-09-13 11:48:57,080 INFO L226 Difference]: Without dead ends: 72 [2021-09-13 11:48:57,081 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1219.87ms TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2021-09-13 11:48:57,082 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1251.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.95ms SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1255.78ms IncrementalHoareTripleChecker+Time [2021-09-13 11:48:57,082 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 331 Unknown, 0 Unchecked, 3.95ms Time], IncrementalHoareTripleChecker [82 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1255.78ms Time] [2021-09-13 11:48:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-09-13 11:48:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2021-09-13 11:48:57,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:48:57,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:57,130 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:57,130 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:57,132 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2021-09-13 11:48:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2021-09-13 11:48:57,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:57,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:57,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2021-09-13 11:48:57,133 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2021-09-13 11:48:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:48:57,135 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2021-09-13 11:48:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2021-09-13 11:48:57,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:48:57,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:48:57,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:48:57,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:48:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-09-13 11:48:57,137 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 18 [2021-09-13 11:48:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:48:57,137 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-09-13 11:48:57,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:48:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-09-13 11:48:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 11:48:57,138 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:48:57,138 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:48:57,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-09-13 11:48:57,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 11:48:57,358 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:48:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:48:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash 798963152, now seen corresponding path program 1 times [2021-09-13 11:48:57,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 11:48:57,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912152267] [2021-09-13 11:48:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 11:48:57,359 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 11:48:57,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 11:48:57,359 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 11:48:57,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-09-13 11:48:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:57,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 11:48:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:48:57,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:48:57,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:57,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:57,792 INFO L354 Elim1Store]: treesize reduction 34, result has 42.4 percent of original size [2021-09-13 11:48:57,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 45 [2021-09-13 11:48:57,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2021-09-13 11:48:57,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:57,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:57,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:57,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:57,924 INFO L354 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2021-09-13 11:48:57,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 138 treesize of output 127 [2021-09-13 11:48:58,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:58,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:58,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:58,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:58,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:58,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:48:58,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:58,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:48:58,312 INFO L354 Elim1Store]: treesize reduction 132, result has 15.9 percent of original size [2021-09-13 11:48:58,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 6 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 47 case distinctions, treesize of input 278 treesize of output 201 [2021-09-13 11:49:03,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:49:03,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:49:03,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:49:03,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:03,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:49:03,369 INFO L354 Elim1Store]: treesize reduction 92, result has 20.0 percent of original size [2021-09-13 11:49:03,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 6 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 371 treesize of output 141 [2021-09-13 11:49:03,435 INFO L281 TraceCheckUtils]: 0: Hoare triple {1975#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {1975#true} is VALID [2021-09-13 11:49:03,435 INFO L281 TraceCheckUtils]: 1: Hoare triple {1975#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1975#true} is VALID [2021-09-13 11:49:03,435 INFO L281 TraceCheckUtils]: 2: Hoare triple {1975#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1975#true} is VALID [2021-09-13 11:49:03,435 INFO L281 TraceCheckUtils]: 3: Hoare triple {1975#true} assume !(0bv32 == assume_abort_if_not_~cond); {1975#true} is VALID [2021-09-13 11:49:03,439 INFO L281 TraceCheckUtils]: 4: Hoare triple {1975#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {1992#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:49:03,444 INFO L281 TraceCheckUtils]: 5: Hoare triple {1992#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {1996#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))))} is VALID [2021-09-13 11:49:03,446 INFO L281 TraceCheckUtils]: 6: Hoare triple {1996#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {1996#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))))} is VALID [2021-09-13 11:49:03,447 INFO L281 TraceCheckUtils]: 7: Hoare triple {1996#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {1996#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))))} is VALID [2021-09-13 11:49:03,448 INFO L281 TraceCheckUtils]: 8: Hoare triple {1996#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {2006#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:49:03,460 INFO L281 TraceCheckUtils]: 9: Hoare triple {2006#(and (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= (_ bv0 32) ULTIMATE.start_main_~a~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (= ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) ((_ sign_extend 32) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~i~0))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem13 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call main_#t~mem14 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem13, main_#t~mem14), main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem13;havoc main_#t~mem14; {2010#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))))} is VALID [2021-09-13 11:49:03,462 INFO L281 TraceCheckUtils]: 10: Hoare triple {2010#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))))} main_#t~post12 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post12);havoc main_#t~post12; {2010#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))))} is VALID [2021-09-13 11:49:03,463 INFO L281 TraceCheckUtils]: 11: Hoare triple {2010#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {2010#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))))} is VALID [2021-09-13 11:49:03,465 INFO L281 TraceCheckUtils]: 12: Hoare triple {2010#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))))} main_~i~0 := ~sign_extendFrom32To64(0bv32); {2020#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:49:03,466 INFO L281 TraceCheckUtils]: 13: Hoare triple {2020#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2020#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:49:03,467 INFO L281 TraceCheckUtils]: 14: Hoare triple {2020#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {2020#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:49:03,468 INFO L281 TraceCheckUtils]: 15: Hoare triple {2020#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} havoc main_#t~mem16; {2020#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} is VALID [2021-09-13 11:49:03,469 INFO L281 TraceCheckUtils]: 16: Hoare triple {2020#(and (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~i~0))} main_#t~post15 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post15);havoc main_#t~post15; {2033#(and (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))))} is VALID [2021-09-13 11:49:03,474 INFO L281 TraceCheckUtils]: 17: Hoare triple {2033#(and (= ULTIMATE.start_main_~i~0 (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) ULTIMATE.start_main_~b~0.offset)) (= ((_ extract 63 32) ((_ sign_extend 32) (_ bv1 32))) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) ULTIMATE.start_main_~b~0.offset))) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32))) (and (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32))))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv4 32)) ((_ extract 63 32) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (_ bv0 32)) ((_ extract 31 0) ((_ sign_extend 32) (_ bv8 32)))) (= (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)))))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)))))))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2037#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 11:49:03,475 INFO L281 TraceCheckUtils]: 18: Hoare triple {2037#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1976#false} is VALID [2021-09-13 11:49:03,475 INFO L281 TraceCheckUtils]: 19: Hoare triple {1976#false} assume !false; {1976#false} is VALID [2021-09-13 11:49:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:49:03,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 11:49:19,620 INFO L281 TraceCheckUtils]: 19: Hoare triple {1976#false} assume !false; {1976#false} is VALID [2021-09-13 11:49:19,621 INFO L281 TraceCheckUtils]: 18: Hoare triple {2047#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1976#false} is VALID [2021-09-13 11:49:21,632 INFO L281 TraceCheckUtils]: 17: Hoare triple {2051#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2047#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is UNKNOWN [2021-09-13 11:49:23,656 INFO L281 TraceCheckUtils]: 16: Hoare triple {2055#(= (bvadd (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} main_#t~post15 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post15);havoc main_#t~post15; {2051#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0)))} is UNKNOWN [2021-09-13 11:49:23,656 INFO L281 TraceCheckUtils]: 15: Hoare triple {2055#(= (bvadd (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} havoc main_#t~mem16; {2055#(= (bvadd (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:49:23,657 INFO L281 TraceCheckUtils]: 14: Hoare triple {2055#(= (bvadd (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} assume !(0bv32 == __VERIFIER_assert_~cond); {2055#(= (bvadd (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:49:23,657 INFO L281 TraceCheckUtils]: 13: Hoare triple {2055#(= (bvadd (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem16 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);__VERIFIER_assert_#in~cond := (if main_#t~mem16 == ~bvadd64(~bvadd64(~bvmul64(~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0), main_~i~0), ~bvmul64(~sign_extendFrom32To64(4bv32), main_~i~0)), ~sign_extendFrom32To64(1bv32)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2055#(= (bvadd (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:49:23,658 INFO L281 TraceCheckUtils]: 12: Hoare triple {2068#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))} main_~i~0 := ~sign_extendFrom32To64(0bv32); {2055#(= (bvadd (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~i~0) (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ULTIMATE.start_main_~i~0))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (_ bv1 64) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:49:23,658 INFO L281 TraceCheckUtils]: 11: Hoare triple {2068#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {2068#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2021-09-13 11:49:23,659 INFO L281 TraceCheckUtils]: 10: Hoare triple {2068#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))} main_#t~post12 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post12);havoc main_#t~post12; {2068#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2021-09-13 11:49:23,664 INFO L281 TraceCheckUtils]: 9: Hoare triple {2078#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem13 := read~intINTTYPE8(main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call main_#t~mem14 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem13, main_#t~mem14), main_~b~0.base, ~bvadd32(main_~b~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem13;havoc main_#t~mem14; {2068#(= (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2021-09-13 11:49:23,665 INFO L281 TraceCheckUtils]: 8: Hoare triple {2082#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} main_~i~0 := ~sign_extendFrom32To64(1bv32); {2078#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:49:23,666 INFO L281 TraceCheckUtils]: 7: Hoare triple {2082#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} assume !~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0)); {2082#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:49:23,666 INFO L281 TraceCheckUtils]: 6: Hoare triple {2082#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} main_#t~post10 := main_~i~0;main_~i~0 := ~bvadd64(1bv64, main_#t~post10);havoc main_#t~post10; {2082#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:49:23,746 INFO L281 TraceCheckUtils]: 5: Hoare triple {2092#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} assume !!~bvslt64(main_~i~0, ~sign_extendFrom32To64(~N~0));call main_#t~mem11 := read~intINTTYPE8(main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, ~bvsub64(main_~i~0, ~sign_extendFrom32To64(1bv32))[32:0])), 8bv32);call write~intINTTYPE8(~bvadd64(main_#t~mem11, ~sign_extendFrom32To64(8bv32)), main_~a~0.base, ~bvadd32(main_~a~0.offset, ~bvmul32(8bv32, main_~i~0[32:0])), 8bv32);havoc main_#t~mem11; {2082#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))) (concat (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:49:23,755 INFO L281 TraceCheckUtils]: 4: Hoare triple {1975#true} havoc main_~i~0;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;havoc main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(~bvmul32(8bv32, ~N~0));main_~b~0.base, main_~b~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;havoc main_#t~malloc9.base, main_#t~malloc9.offset;call write~intINTTYPE8(~sign_extendFrom32To64(8bv32), main_~a~0.base, main_~a~0.offset, 8bv32);call write~intINTTYPE8(~sign_extendFrom32To64(1bv32), main_~b~0.base, main_~b~0.offset, 8bv32);main_~i~0 := ~sign_extendFrom32To64(1bv32); {2092#(= (bvadd (bvmul (_ bv3 64) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)))) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv4 32))) ((_ sign_extend 32) (_ bv1 32)) (bvmul ((_ sign_extend 32) (_ bv4 32)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) (concat (select (store (store (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (store (store (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 31 0) (bvadd (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ((_ sign_extend 32) (_ bv1 32))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset) ((_ extract 63 32) (bvadd (concat (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset)) (select (select (store |#memory_int| ULTIMATE.start_main_~a~0.base (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset))))))) ULTIMATE.start_main_~b~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))) (concat (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)) (select (store (store (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) ULTIMATE.start_main_~i~0) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset) ((_ extract 63 32) (bvadd ((_ sign_extend 32) (_ bv8 32)) (concat (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) (_ bv4 32) ULTIMATE.start_main_~a~0.offset)) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ULTIMATE.start_main_~i~0)) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) (_ bv1 32))) ((_ sign_extend 32) (_ bv1 32)))) (_ bv8 32)) ULTIMATE.start_main_~a~0.offset)))))) (bvadd (bvmul ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (_ bv8 32)) ULTIMATE.start_main_~b~0.offset))))} is VALID [2021-09-13 11:49:23,755 INFO L281 TraceCheckUtils]: 3: Hoare triple {1975#true} assume !(0bv32 == assume_abort_if_not_~cond); {1975#true} is VALID [2021-09-13 11:49:23,756 INFO L281 TraceCheckUtils]: 2: Hoare triple {1975#true} assume !~bvsle32(~N~0, 0bv32);assume_abort_if_not_#in~cond := (if ~bvsle32(~N~0, 536870911bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1975#true} is VALID [2021-09-13 11:49:23,756 INFO L281 TraceCheckUtils]: 1: Hoare triple {1975#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~mem11, main_#t~post10, main_#t~mem13, main_#t~mem14, main_#t~post12, main_#t~mem16, main_#t~post15, main_~i~0, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;~N~0 := main_#t~nondet7;havoc main_#t~nondet7; {1975#true} is VALID [2021-09-13 11:49:23,756 INFO L281 TraceCheckUtils]: 0: Hoare triple {1975#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(7bv32);call write~init~intINTTYPE1(101bv8, #t~string5.base, #t~string5.offset, 1bv32);call write~init~intINTTYPE1(113bv8, #t~string5.base, ~bvadd32(1bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(110bv8, #t~string5.base, ~bvadd32(2bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(52bv8, #t~string5.base, ~bvadd32(3bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(46bv8, #t~string5.base, ~bvadd32(4bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(99bv8, #t~string5.base, ~bvadd32(5bv32, #t~string5.offset), 1bv32);call write~init~intINTTYPE1(0bv8, #t~string5.base, ~bvadd32(6bv32, #t~string5.offset), 1bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~N~0 := 0bv32; {1975#true} is VALID [2021-09-13 11:49:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 11:49:23,757 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 11:49:23,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912152267] [2021-09-13 11:49:23,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912152267] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 11:49:23,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 11:49:23,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-09-13 11:49:23,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454114722] [2021-09-13 11:49:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 11:49:23,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 11:49:23,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:49:28,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 11:49:28,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-09-13 11:49:28,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 11:49:28,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-09-13 11:49:28,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-09-13 11:49:28,216 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:49:34,478 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-09-13 11:49:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:49:41,799 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-09-13 11:49:41,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-13 11:49:41,799 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-09-13 11:49:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 11:49:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:49:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 47 transitions. [2021-09-13 11:49:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:49:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 47 transitions. [2021-09-13 11:49:41,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 47 transitions. [2021-09-13 11:49:42,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 11:49:42,412 INFO L225 Difference]: With dead ends: 48 [2021-09-13 11:49:42,413 INFO L226 Difference]: Without dead ends: 46 [2021-09-13 11:49:42,413 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 6294.77ms TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-09-13 11:49:42,414 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6680.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.48ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 6711.62ms IncrementalHoareTripleChecker+Time [2021-09-13 11:49:42,414 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 230 Unknown, 0 Unchecked, 2.48ms Time], IncrementalHoareTripleChecker [11 Valid, 175 Invalid, 1 Unknown, 43 Unchecked, 6711.62ms Time] [2021-09-13 11:49:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-09-13 11:49:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2021-09-13 11:49:42,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 11:49:42,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:49:42,498 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:49:42,498 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:49:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:49:42,499 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-09-13 11:49:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-09-13 11:49:42,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:49:42,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:49:42,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2021-09-13 11:49:42,500 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2021-09-13 11:49:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 11:49:42,501 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-09-13 11:49:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-09-13 11:49:42,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 11:49:42,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 11:49:42,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 11:49:42,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 11:49:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:49:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-09-13 11:49:42,503 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2021-09-13 11:49:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 11:49:42,504 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-09-13 11:49:42,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 11:49:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-09-13 11:49:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 11:49:42,504 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 11:49:42,505 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 11:49:42,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-09-13 11:49:42,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 11:49:42,717 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 11:49:42,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 11:49:42,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1786143722, now seen corresponding path program 3 times [2021-09-13 11:49:42,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 11:49:42,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145048236] [2021-09-13 11:49:42,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 11:49:42,718 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 11:49:42,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 11:49:42,719 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 11:49:42,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-09-13 11:49:42,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-09-13 11:49:42,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 11:49:42,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 11:49:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 11:49:42,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:49:45,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:45,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:45,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:45,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:45,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:49:45,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:45,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:45,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:49:45,222 INFO L354 Elim1Store]: treesize reduction 34, result has 42.4 percent of original size [2021-09-13 11:49:45,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 45 [2021-09-13 11:49:45,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-09-13 11:49:45,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:45,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:45,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-09-13 11:49:46,228 INFO L354 Elim1Store]: treesize reduction 883, result has 10.4 percent of original size [2021-09-13 11:49:46,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 22 case distinctions, treesize of input 132 treesize of output 141 [2021-09-13 11:49:50,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:49:50,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-09-13 11:50:30,093 WARN L210 SmtUtils]: Spent 39.93s on a formula simplification. DAG size of input: 247 DAG size of output: 97 [2021-09-13 11:50:30,232 INFO L354 Elim1Store]: treesize reduction 1397, result has 17.6 percent of original size [2021-09-13 11:50:30,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 237 treesize of output 385 [2021-09-13 11:55:05,470 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-09-13 11:55:05,471 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 11:55:05,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145048236] [2021-09-13 11:55:05,472 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-09-13 11:55:05,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [34775562] [2021-09-13 11:55:05,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 11:55:05,472 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-09-13 11:55:05,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-09-13 11:55:05,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2021-09-13 11:55:05,493 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-09-13 11:55:05,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-09-13 11:55:05,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 11:55:05,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154545648] [2021-09-13 11:55:05,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 11:55:05,996 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 11:55:05,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 11:55:05,997 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 11:55:06,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 1 [2021-09-13 11:55:06,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-09-13 11:55:06,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-09-13 11:55:06,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 11:55:06,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 21 conjunts are in the unsatisfiable core [2021-09-13 11:55:06,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 11:55:06,185 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken [2021-09-13 11:55:06,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-09-13 11:55:06,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-09-13 11:55:06,185 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-09-13 11:55:06,185 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-09-13 11:55:06,189 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 11:55:06,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-09-13 11:55:06,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-09-13 11:55:06,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 11:55:06,596 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2021-09-13 11:55:06,611 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2021-09-13 11:55:06,612 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2021-09-13 11:55:06,612 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 11:55:06,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 11:55:06 BoogieIcfgContainer [2021-09-13 11:55:06,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 11:55:06,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 11:55:06,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 11:55:06,613 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 11:55:06,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:47:53" (3/4) ... [2021-09-13 11:55:06,616 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-09-13 11:55:06,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 11:55:06,617 INFO L158 Benchmark]: Toolchain (without parser) took 433740.83ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 47.7MB in the beginning and 39.4MB in the end (delta: 8.3MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2021-09-13 11:55:06,618 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 81.8MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 11:55:06,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.98ms. Allocated memory is still 81.8MB. Free memory was 47.5MB in the beginning and 65.2MB in the end (delta: -17.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2021-09-13 11:55:06,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.12ms. Allocated memory is still 81.8MB. Free memory was 65.1MB in the beginning and 63.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 11:55:06,618 INFO L158 Benchmark]: Boogie Preprocessor took 33.38ms. Allocated memory is still 81.8MB. Free memory was 63.2MB in the beginning and 61.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 11:55:06,619 INFO L158 Benchmark]: RCFGBuilder took 672.49ms. Allocated memory is still 81.8MB. Free memory was 61.5MB in the beginning and 48.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 11:55:06,619 INFO L158 Benchmark]: TraceAbstraction took 432673.69ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 47.9MB in the beginning and 39.4MB in the end (delta: 8.5MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2021-09-13 11:55:06,619 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 104.9MB. Free memory is still 39.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 11:55:06,620 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 81.8MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.98ms. Allocated memory is still 81.8MB. Free memory was 47.5MB in the beginning and 65.2MB in the end (delta: -17.8MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.12ms. Allocated memory is still 81.8MB. Free memory was 65.1MB in the beginning and 63.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.38ms. Allocated memory is still 81.8MB. Free memory was 63.2MB in the beginning and 61.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 672.49ms. Allocated memory is still 81.8MB. Free memory was 61.5MB in the beginning and 48.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 432673.69ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 47.9MB in the beginning and 39.4MB in the end (delta: 8.5MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 104.9MB. Free memory is still 39.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 15]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L13] COND FALSE !(!cond) [L27] long long i; [L28] long long *a = malloc(sizeof(long long)*N); [L29] long long *b = malloc(sizeof(long long)*N); [L31] a[0] = 8 [L32] b[0] = 1 [L33] i=1 [L33] COND TRUE i