./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 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-cav19/array_min_and_copy_shift_sum_add.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 8262fd4bdb4bed8fef0fbefd142e15775d81a64587fab0af0aa2004f91ae895c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:25:59,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:25:59,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:25:59,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:25:59,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:25:59,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:25:59,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:25:59,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:25:59,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:25:59,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:25:59,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:25:59,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:25:59,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:25:59,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:25:59,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:25:59,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:25:59,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:25:59,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:25:59,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:25:59,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:25:59,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:25:59,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:25:59,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:25:59,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:25:59,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:25:59,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:25:59,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:25:59,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:25:59,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:25:59,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:25:59,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:25:59,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:25:59,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:25:59,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:25:59,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:25:59,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:25:59,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:25:59,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:25:59,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:25:59,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:25:59,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:25:59,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:25:59,787 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:25:59,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:25:59,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:25:59,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:25:59,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:25:59,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:25:59,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:25:59,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:25:59,790 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:25:59,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:25:59,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:25:59,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:25:59,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:25:59,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:25:59,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:25:59,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:25:59,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:25:59,793 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:25:59,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:25:59,793 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:25:59,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:25:59,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:25:59,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:25:59,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:25:59,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:25:59,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:25:59,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:25:59,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:25:59,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:25:59,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:25:59,796 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:25:59,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:25:59,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:25:59,797 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 -> 8262fd4bdb4bed8fef0fbefd142e15775d81a64587fab0af0aa2004f91ae895c [2022-02-20 14:26:00,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:26:00,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:26:00,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:26:00,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:26:00,069 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:26:00,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c [2022-02-20 14:26:00,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed55d138/a3e04eb0c2574717bdb8bc7c73a53db5/FLAG14e81e555 [2022-02-20 14:26:00,476 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:26:00,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c [2022-02-20 14:26:00,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed55d138/a3e04eb0c2574717bdb8bc7c73a53db5/FLAG14e81e555 [2022-02-20 14:26:00,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed55d138/a3e04eb0c2574717bdb8bc7c73a53db5 [2022-02-20 14:26:00,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:26:00,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:26:00,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:00,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:26:00,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:26:00,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4653ea0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00, skipping insertion in model container [2022-02-20 14:26:00,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:26:00,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:26:00,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c[423,436] [2022-02-20 14:26:00,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:00,697 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:26:00,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c[423,436] [2022-02-20 14:26:00,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:00,743 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:26:00,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00 WrapperNode [2022-02-20 14:26:00,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:00,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:00,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:26:00,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:26:00,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,793 INFO L137 Inliner]: procedures = 15, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2022-02-20 14:26:00,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:00,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:26:00,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:26:00,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:26:00,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:26:00,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:26:00,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:26:00,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:26:00,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (1/1) ... [2022-02-20 14:26:00,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:00,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:00,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:26:00,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:26:00,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:26:00,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:26:00,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:26:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:26:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:26:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:26:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:26:00,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:26:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:26:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:26:00,978 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:26:00,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:26:01,236 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:26:01,241 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:26:01,242 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:26:01,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:01 BoogieIcfgContainer [2022-02-20 14:26:01,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:26:01,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:26:01,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:26:01,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:26:01,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:26:00" (1/3) ... [2022-02-20 14:26:01,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a0b569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:01, skipping insertion in model container [2022-02-20 14:26:01,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:00" (2/3) ... [2022-02-20 14:26:01,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a0b569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:01, skipping insertion in model container [2022-02-20 14:26:01,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:01" (3/3) ... [2022-02-20 14:26:01,254 INFO L111 eAbstractionObserver]: Analyzing ICFG array_min_and_copy_shift_sum_add.c [2022-02-20 14:26:01,258 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:26:01,258 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:26:01,292 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:26:01,298 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, mAutomataTypeConcurrency=PETRI_NET, 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 [2022-02-20 14:26:01,298 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:26:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:26:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:26:01,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:01,318 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:01,319 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:01,325 INFO L85 PathProgramCache]: Analyzing trace with hash -459580484, now seen corresponding path program 1 times [2022-02-20 14:26:01,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:01,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434821042] [2022-02-20 14:26:01,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:01,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:01,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:01,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-02-20 14:26:01,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume !(0 == ~cond); {33#true} is VALID [2022-02-20 14:26:01,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-02-20 14:26:01,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-02-20 14:26:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 14:26:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:01,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-02-20 14:26:01,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume !(0 == ~cond); {33#true} is VALID [2022-02-20 14:26:01,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-02-20 14:26:01,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} #86#return; {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-02-20 14:26:01,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {33#true} is VALID [2022-02-20 14:26:01,667 INFO L272 TraceCheckUtils]: 2: Hoare triple {33#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {33#true} is VALID [2022-02-20 14:26:01,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-02-20 14:26:01,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#true} assume !(0 == ~cond); {33#true} is VALID [2022-02-20 14:26:01,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} assume true; {33#true} is VALID [2022-02-20 14:26:01,669 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-02-20 14:26:01,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,670 INFO L272 TraceCheckUtils]: 8: Hoare triple {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {33#true} is VALID [2022-02-20 14:26:01,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-02-20 14:26:01,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#true} assume !(0 == ~cond); {33#true} is VALID [2022-02-20 14:26:01,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#true} assume true; {33#true} is VALID [2022-02-20 14:26:01,672 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33#true} {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} #86#return; {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} main_~i~0#1 := 0; {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} main_~i~0#1 := 0; {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:01,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {44#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:01,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {34#false} is VALID [2022-02-20 14:26:01,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 14:26:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:01,680 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:01,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434821042] [2022-02-20 14:26:01,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434821042] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:01,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:01,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:26:01,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958808625] [2022-02-20 14:26:01,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:01,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 14:26:01,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:01,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:01,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:01,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:26:01,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:26:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:26:01,764 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:01,905 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2022-02-20 14:26:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:26:01,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 14:26:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-02-20 14:26:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-02-20 14:26:01,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2022-02-20 14:26:02,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:02,034 INFO L225 Difference]: With dead ends: 64 [2022-02-20 14:26:02,034 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:26:02,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:02,046 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:02,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 78 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:26:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 14:26:02,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:02,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:26:02,079 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:26:02,080 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:26:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:02,086 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-20 14:26:02,086 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 14:26:02,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:02,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:02,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-20 14:26:02,088 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-02-20 14:26:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:02,094 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-20 14:26:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 14:26:02,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:02,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:02,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:02,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:26:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-02-20 14:26:02,101 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2022-02-20 14:26:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:02,102 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-20 14:26:02,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:26:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 14:26:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:26:02,103 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:02,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:02,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:26:02,104 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash 778020126, now seen corresponding path program 1 times [2022-02-20 14:26:02,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:02,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120865864] [2022-02-20 14:26:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:02,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:02,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#true} ~cond := #in~cond; {219#true} is VALID [2022-02-20 14:26:02,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume !(0 == ~cond); {219#true} is VALID [2022-02-20 14:26:02,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 14:26:02,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #84#return; {219#true} is VALID [2022-02-20 14:26:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 14:26:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:02,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#true} ~cond := #in~cond; {219#true} is VALID [2022-02-20 14:26:02,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume !(0 == ~cond); {219#true} is VALID [2022-02-20 14:26:02,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 14:26:02,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #86#return; {219#true} is VALID [2022-02-20 14:26:02,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {219#true} is VALID [2022-02-20 14:26:02,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {219#true} is VALID [2022-02-20 14:26:02,208 INFO L272 TraceCheckUtils]: 2: Hoare triple {219#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {219#true} is VALID [2022-02-20 14:26:02,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {219#true} ~cond := #in~cond; {219#true} is VALID [2022-02-20 14:26:02,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {219#true} assume !(0 == ~cond); {219#true} is VALID [2022-02-20 14:26:02,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 14:26:02,209 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {219#true} {219#true} #84#return; {219#true} is VALID [2022-02-20 14:26:02,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {219#true} is VALID [2022-02-20 14:26:02,209 INFO L272 TraceCheckUtils]: 8: Hoare triple {219#true} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {219#true} is VALID [2022-02-20 14:26:02,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#true} ~cond := #in~cond; {219#true} is VALID [2022-02-20 14:26:02,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {219#true} assume !(0 == ~cond); {219#true} is VALID [2022-02-20 14:26:02,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {219#true} assume true; {219#true} is VALID [2022-02-20 14:26:02,213 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {219#true} {219#true} #86#return; {219#true} is VALID [2022-02-20 14:26:02,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#true} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {229#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:02,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {229#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < main_~N~0#1); {230#(<= |ULTIMATE.start_main_~N~0#1| 0)} is VALID [2022-02-20 14:26:02,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {230#(<= |ULTIMATE.start_main_~N~0#1| 0)} main_~i~0#1 := 0; {230#(<= |ULTIMATE.start_main_~N~0#1| 0)} is VALID [2022-02-20 14:26:02,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#(<= |ULTIMATE.start_main_~N~0#1| 0)} assume !(main_~i~0#1 < main_~N~0#1); {230#(<= |ULTIMATE.start_main_~N~0#1| 0)} is VALID [2022-02-20 14:26:02,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {230#(<= |ULTIMATE.start_main_~N~0#1| 0)} main_~i~0#1 := 0; {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~N~0#1| 0))} is VALID [2022-02-20 14:26:02,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~N~0#1| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {220#false} is VALID [2022-02-20 14:26:02,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {220#false} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {220#false} is VALID [2022-02-20 14:26:02,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {220#false} assume !(main_~i~0#1 < main_~N~0#1); {220#false} is VALID [2022-02-20 14:26:02,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {220#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {220#false} is VALID [2022-02-20 14:26:02,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {220#false} assume 0 == __VERIFIER_assert_~cond#1; {220#false} is VALID [2022-02-20 14:26:02,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-02-20 14:26:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:26:02,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:02,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120865864] [2022-02-20 14:26:02,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120865864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:02,220 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:02,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:26:02,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40032533] [2022-02-20 14:26:02,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:02,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 14:26:02,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:02,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:02,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:02,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:26:02,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:02,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:26:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:02,255 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:02,445 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-02-20 14:26:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:26:02,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 14:26:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 14:26:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 14:26:02,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-02-20 14:26:02,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:02,520 INFO L225 Difference]: With dead ends: 50 [2022-02-20 14:26:02,521 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:26:02,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:02,522 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:02,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 71 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:02,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:26:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-02-20 14:26:02,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:02,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:26:02,547 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:26:02,548 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:26:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:02,552 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:26:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 14:26:02,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:02,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:02,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-02-20 14:26:02,553 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 36 states. [2022-02-20 14:26:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:02,556 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:26:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 14:26:02,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:02,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:02,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:02,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:26:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-20 14:26:02,558 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-02-20 14:26:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:02,559 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-20 14:26:02,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 14:26:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 14:26:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 14:26:02,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:02,560 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:02,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:26:02,561 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash 104610043, now seen corresponding path program 1 times [2022-02-20 14:26:02,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:02,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241596164] [2022-02-20 14:26:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:02,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:02,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:02,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:02,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:02,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411#true} {411#true} #84#return; {411#true} is VALID [2022-02-20 14:26:02,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 14:26:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:02,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:02,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:02,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:02,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411#true} {417#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {417#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:02,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 14:26:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:02,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:02,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:02,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:02,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411#true} {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} #88#return; {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:02,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {411#true} is VALID [2022-02-20 14:26:02,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {411#true} is VALID [2022-02-20 14:26:02,991 INFO L272 TraceCheckUtils]: 2: Hoare triple {411#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {411#true} is VALID [2022-02-20 14:26:02,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:02,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:02,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:02,992 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {411#true} {411#true} #84#return; {411#true} is VALID [2022-02-20 14:26:02,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {417#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:02,993 INFO L272 TraceCheckUtils]: 8: Hoare triple {417#(= |ULTIMATE.start_main_~k~0#1| 0)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {411#true} is VALID [2022-02-20 14:26:02,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:02,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:02,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:02,995 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {411#true} {417#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {417#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:02,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#(= |ULTIMATE.start_main_~k~0#1| 0)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:02,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:02,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:02,998 INFO L272 TraceCheckUtils]: 16: Hoare triple {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {411#true} is VALID [2022-02-20 14:26:02,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:02,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:02,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:03,000 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {411#true} {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} #88#return; {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {422#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {427#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:03,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {427#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {428#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {428#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~i~0#1 < main_~N~0#1); {428#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {428#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_~i~0#1 := 0; {427#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:03,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {427#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {429#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:26:03,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {429#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {430#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0)))} is VALID [2022-02-20 14:26:03,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {430#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0)))} assume !(main_~i~0#1 < main_~N~0#1); {430#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0)))} is VALID [2022-02-20 14:26:03,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {430#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0)))} main_~i~0#1 := 0; {429#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:26:03,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {429#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:03,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:03,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:03,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {433#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:03,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {433#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {412#false} is VALID [2022-02-20 14:26:03,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-02-20 14:26:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:26:03,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:03,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241596164] [2022-02-20 14:26:03,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241596164] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:03,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403615247] [2022-02-20 14:26:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:03,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:03,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:03,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:03,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:26:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:03,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 14:26:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:03,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:03,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 14:26:03,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 14:26:03,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {411#true} is VALID [2022-02-20 14:26:03,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {411#true} is VALID [2022-02-20 14:26:03,721 INFO L272 TraceCheckUtils]: 2: Hoare triple {411#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {411#true} is VALID [2022-02-20 14:26:03,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:03,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:03,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:03,722 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {411#true} {411#true} #84#return; {411#true} is VALID [2022-02-20 14:26:03,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:03,735 INFO L272 TraceCheckUtils]: 8: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {411#true} is VALID [2022-02-20 14:26:03,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:03,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:03,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:03,738 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {411#true} {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} #86#return; {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:03,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,741 INFO L272 TraceCheckUtils]: 16: Hoare triple {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {411#true} is VALID [2022-02-20 14:26:03,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:03,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:03,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:03,742 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {411#true} {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} #88#return; {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {476#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {504#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {504#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {504#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {504#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~i~0#1 < main_~N~0#1); {504#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {504#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_~i~0#1 := 0; {514#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:03,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {514#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {518#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:03,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {518#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {518#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:03,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {518#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} assume !(main_~i~0#1 < main_~N~0#1); {518#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:03,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {518#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} main_~i~0#1 := 0; {528#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:03,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {528#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:03,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:03,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:03,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {541#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:03,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {541#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {412#false} is VALID [2022-02-20 14:26:03,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-02-20 14:26:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:26:03,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:08,125 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:08,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2022-02-20 14:26:08,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-02-20 14:26:08,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {541#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {412#false} is VALID [2022-02-20 14:26:08,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {541#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:08,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:08,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:08,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {563#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:08,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {567#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} main_~i~0#1 := 0; {563#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:08,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {567#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} assume !(main_~i~0#1 < main_~N~0#1); {567#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {567#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {567#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {577#(forall ((v_ArrVal_26 Int) (|ULTIMATE.start_main_~#b~0#1.base| Int)) (or (<= 0 (+ |ULTIMATE.start_main_~k~0#1| (select (store (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_26) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| v_ArrVal_26)))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {567#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {581#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} main_~i~0#1 := 0; {577#(forall ((v_ArrVal_26 Int) (|ULTIMATE.start_main_~#b~0#1.base| Int)) (or (<= 0 (+ |ULTIMATE.start_main_~k~0#1| (select (store (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_26) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| v_ArrVal_26)))))} is VALID [2022-02-20 14:26:08,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {581#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} assume !(main_~i~0#1 < main_~N~0#1); {581#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {581#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {581#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {581#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,307 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {411#true} {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} #88#return; {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:08,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:08,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:08,309 INFO L272 TraceCheckUtils]: 16: Hoare triple {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {411#true} is VALID [2022-02-20 14:26:08,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {431#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:08,312 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {411#true} {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} #86#return; {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:08,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:08,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:08,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:08,312 INFO L272 TraceCheckUtils]: 8: Hoare triple {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {411#true} is VALID [2022-02-20 14:26:08,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {432#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:08,313 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {411#true} {411#true} #84#return; {411#true} is VALID [2022-02-20 14:26:08,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 14:26:08,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {411#true} assume !(0 == ~cond); {411#true} is VALID [2022-02-20 14:26:08,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {411#true} ~cond := #in~cond; {411#true} is VALID [2022-02-20 14:26:08,314 INFO L272 TraceCheckUtils]: 2: Hoare triple {411#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {411#true} is VALID [2022-02-20 14:26:08,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {411#true} is VALID [2022-02-20 14:26:08,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {411#true} is VALID [2022-02-20 14:26:08,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:26:08,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403615247] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:08,315 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:08,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-02-20 14:26:08,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933623350] [2022-02-20 14:26:08,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:08,317 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-02-20 14:26:08,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:08,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:08,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:08,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 14:26:08,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 14:26:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=329, Unknown=2, NotChecked=0, Total=420 [2022-02-20 14:26:08,390 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:08,948 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-02-20 14:26:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:26:08,948 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-02-20 14:26:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-02-20 14:26:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 68 transitions. [2022-02-20 14:26:08,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 68 transitions. [2022-02-20 14:26:09,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:09,023 INFO L225 Difference]: With dead ends: 54 [2022-02-20 14:26:09,023 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 14:26:09,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=118, Invalid=432, Unknown=2, NotChecked=0, Total=552 [2022-02-20 14:26:09,024 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:09,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 161 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-02-20 14:26:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 14:26:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2022-02-20 14:26:09,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:09,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:09,046 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:09,046 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:09,050 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-02-20 14:26:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-02-20 14:26:09,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:09,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:09,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-02-20 14:26:09,054 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-02-20 14:26:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:09,060 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-02-20 14:26:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-02-20 14:26:09,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:09,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:09,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:09,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-02-20 14:26:09,070 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 36 [2022-02-20 14:26:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:09,071 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-02-20 14:26:09,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 14:26:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 14:26:09,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:09,074 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:09,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:09,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:09,288 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:09,288 INFO L85 PathProgramCache]: Analyzing trace with hash -906507207, now seen corresponding path program 1 times [2022-02-20 14:26:09,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:09,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121795872] [2022-02-20 14:26:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:09,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:09,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:09,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:09,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #84#return; {895#true} is VALID [2022-02-20 14:26:09,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 14:26:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:09,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:09,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:09,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {901#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {901#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:09,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 14:26:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:09,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:09,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:09,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} #88#return; {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:09,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {895#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {895#true} is VALID [2022-02-20 14:26:09,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {895#true} is VALID [2022-02-20 14:26:09,627 INFO L272 TraceCheckUtils]: 2: Hoare triple {895#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {895#true} is VALID [2022-02-20 14:26:09,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:09,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:09,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:09,628 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {895#true} {895#true} #84#return; {895#true} is VALID [2022-02-20 14:26:09,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {901#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:09,628 INFO L272 TraceCheckUtils]: 8: Hoare triple {901#(= |ULTIMATE.start_main_~k~0#1| 0)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {895#true} is VALID [2022-02-20 14:26:09,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:09,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:09,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:09,630 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {901#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {901#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:09,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {901#(= |ULTIMATE.start_main_~k~0#1| 0)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:09,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:09,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:09,632 INFO L272 TraceCheckUtils]: 16: Hoare triple {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {895#true} is VALID [2022-02-20 14:26:09,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:09,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:09,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:09,633 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {895#true} {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} #88#return; {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:09,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {911#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:09,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {911#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~j~0#1 > main_#t~mem10#1);havoc main_#t~mem10#1; {912#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:09,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {912#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {913#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:09,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~i~0#1 < main_~N~0#1); {913#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:09,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {913#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_~i~0#1 := 0; {912#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:09,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {912#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {914#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:26:09,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {914#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {915#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0)))} is VALID [2022-02-20 14:26:09,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {915#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0)))} assume !(main_~i~0#1 < main_~N~0#1); {915#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0)))} is VALID [2022-02-20 14:26:09,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {915#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0)))} main_~i~0#1 := 0; {914#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:26:09,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {914#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:09,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:09,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:09,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {918#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:09,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {918#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {896#false} is VALID [2022-02-20 14:26:09,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-02-20 14:26:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:26:09,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:09,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121795872] [2022-02-20 14:26:09,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121795872] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:09,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518702072] [2022-02-20 14:26:09,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:09,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:09,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:09,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:26:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 14:26:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:09,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:10,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 14:26:10,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 14:26:10,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {895#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {895#true} is VALID [2022-02-20 14:26:10,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {895#true} is VALID [2022-02-20 14:26:10,242 INFO L272 TraceCheckUtils]: 2: Hoare triple {895#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {895#true} is VALID [2022-02-20 14:26:10,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:10,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:10,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:10,243 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {895#true} {895#true} #84#return; {895#true} is VALID [2022-02-20 14:26:10,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:10,244 INFO L272 TraceCheckUtils]: 8: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {895#true} is VALID [2022-02-20 14:26:10,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:10,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:10,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:10,250 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} #86#return; {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:10,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {961#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:10,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {961#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {961#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:10,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {961#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {961#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:10,253 INFO L272 TraceCheckUtils]: 16: Hoare triple {961#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {895#true} is VALID [2022-02-20 14:26:10,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:10,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:10,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:10,254 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {895#true} {961#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} #88#return; {961#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:10,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {961#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {986#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:10,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {986#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~j~0#1 > main_#t~mem10#1);havoc main_#t~mem10#1; {990#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:10,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {990#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {990#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:10,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {990#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~i~0#1 < main_~N~0#1); {990#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:10,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {990#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_~i~0#1 := 0; {1000#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:10,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {1000#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1004#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:10,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {1004#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1004#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:10,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {1004#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} assume !(main_~i~0#1 < main_~N~0#1); {1004#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:10,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {1004#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} main_~i~0#1 := 0; {1014#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:10,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {1014#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:10,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:10,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:10,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1027#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:10,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {1027#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {896#false} is VALID [2022-02-20 14:26:10,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-02-20 14:26:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:26:10,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:14,649 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:14,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2022-02-20 14:26:14,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-02-20 14:26:14,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {1027#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {896#false} is VALID [2022-02-20 14:26:14,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1027#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:14,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:14,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:14,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {1049#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:14,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {1053#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} main_~i~0#1 := 0; {1049#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:14,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {1053#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} assume !(main_~i~0#1 < main_~N~0#1); {1053#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {1053#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1053#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {1063#(forall ((|ULTIMATE.start_main_~#b~0#1.base| Int) (v_ArrVal_41 Int)) (or (<= 0 (+ |ULTIMATE.start_main_~k~0#1| (select (store (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_41) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| v_ArrVal_41)))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1053#(<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {1067#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} main_~i~0#1 := 0; {1063#(forall ((|ULTIMATE.start_main_~#b~0#1.base| Int) (v_ArrVal_41 Int)) (or (<= 0 (+ |ULTIMATE.start_main_~k~0#1| (select (store (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) v_ArrVal_41) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| v_ArrVal_41)))))} is VALID [2022-02-20 14:26:14,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} assume !(main_~i~0#1 < main_~N~0#1); {1067#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1067#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {1077#(<= |ULTIMATE.start_main_#t~mem10#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} assume !(main_~j~0#1 > main_#t~mem10#1);havoc main_#t~mem10#1; {1067#(<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1077#(<= |ULTIMATE.start_main_#t~mem10#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,798 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {895#true} {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} #88#return; {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:14,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:14,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:14,799 INFO L272 TraceCheckUtils]: 16: Hoare triple {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {895#true} is VALID [2022-02-20 14:26:14,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {916#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:14,801 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} #86#return; {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:14,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:14,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:14,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:14,802 INFO L272 TraceCheckUtils]: 8: Hoare triple {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {895#true} is VALID [2022-02-20 14:26:14,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {917#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:14,803 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {895#true} {895#true} #84#return; {895#true} is VALID [2022-02-20 14:26:14,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} assume true; {895#true} is VALID [2022-02-20 14:26:14,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-02-20 14:26:14,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-02-20 14:26:14,804 INFO L272 TraceCheckUtils]: 2: Hoare triple {895#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {895#true} is VALID [2022-02-20 14:26:14,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {895#true} is VALID [2022-02-20 14:26:14,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {895#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {895#true} is VALID [2022-02-20 14:26:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 14:26:14,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518702072] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:14,805 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:14,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 24 [2022-02-20 14:26:14,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653754176] [2022-02-20 14:26:14,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:14,806 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-02-20 14:26:14,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:14,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:14,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:14,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 14:26:14,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:14,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 14:26:14,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=446, Unknown=2, NotChecked=0, Total=552 [2022-02-20 14:26:14,868 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:15,691 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-02-20 14:26:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:26:15,692 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-02-20 14:26:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-02-20 14:26:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-02-20 14:26:15,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 67 transitions. [2022-02-20 14:26:15,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:15,764 INFO L225 Difference]: With dead ends: 68 [2022-02-20 14:26:15,764 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 14:26:15,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=134, Invalid=566, Unknown=2, NotChecked=0, Total=702 [2022-02-20 14:26:15,766 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:15,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 237 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 304 Invalid, 0 Unknown, 37 Unchecked, 0.3s Time] [2022-02-20 14:26:15,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 14:26:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2022-02-20 14:26:15,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:15,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:15,788 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:15,789 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:15,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:15,796 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-02-20 14:26:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-02-20 14:26:15,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:15,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:15,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 64 states. [2022-02-20 14:26:15,797 INFO L87 Difference]: Start difference. First operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 64 states. [2022-02-20 14:26:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:15,800 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-02-20 14:26:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-02-20 14:26:15,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:15,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:15,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:15,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-02-20 14:26:15,804 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 36 [2022-02-20 14:26:15,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:15,804 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-02-20 14:26:15,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 24 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 14:26:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 14:26:15,807 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:15,807 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:15,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:16,027 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,SelfDestructingSolverStorable3 [2022-02-20 14:26:16,028 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:16,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:16,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1799237277, now seen corresponding path program 2 times [2022-02-20 14:26:16,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:16,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094757091] [2022-02-20 14:26:16,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:16,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:16,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #84#return; {1430#true} is VALID [2022-02-20 14:26:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 14:26:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:16,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #86#return; {1430#true} is VALID [2022-02-20 14:26:16,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 14:26:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:16,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} #88#return; {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {1430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {1430#true} is VALID [2022-02-20 14:26:16,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1430#true} is VALID [2022-02-20 14:26:16,148 INFO L272 TraceCheckUtils]: 2: Hoare triple {1430#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {1430#true} is VALID [2022-02-20 14:26:16,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,149 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1430#true} {1430#true} #84#return; {1430#true} is VALID [2022-02-20 14:26:16,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {1430#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1430#true} is VALID [2022-02-20 14:26:16,149 INFO L272 TraceCheckUtils]: 8: Hoare triple {1430#true} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {1430#true} is VALID [2022-02-20 14:26:16,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,150 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1430#true} {1430#true} #86#return; {1430#true} is VALID [2022-02-20 14:26:16,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {1430#true} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,159 INFO L272 TraceCheckUtils]: 16: Hoare triple {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {1430#true} is VALID [2022-02-20 14:26:16,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,160 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1430#true} {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} #88#return; {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {1440#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1445#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:16,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {1445#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~N~0#1); {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_~i~0#1 := 0; {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !(main_~i~0#1 < main_~N~0#1); {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_~i~0#1 := 0; {1447#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~N~0#1| 1))} is VALID [2022-02-20 14:26:16,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {1447#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~N~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {1447#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~N~0#1| 1))} is VALID [2022-02-20 14:26:16,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {1447#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~N~0#1| 1))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {1448#(<= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:16,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {1448#(<= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {1431#false} is VALID [2022-02-20 14:26:16,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {1431#false} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {1431#false} is VALID [2022-02-20 14:26:16,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {1431#false} assume !(main_~i~0#1 < main_~N~0#1); {1431#false} is VALID [2022-02-20 14:26:16,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {1431#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1431#false} is VALID [2022-02-20 14:26:16,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {1431#false} assume 0 == __VERIFIER_assert_~cond#1; {1431#false} is VALID [2022-02-20 14:26:16,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-02-20 14:26:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 14:26:16,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:16,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094757091] [2022-02-20 14:26:16,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094757091] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:16,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691999265] [2022-02-20 14:26:16,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:16,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:16,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:16,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:16,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:26:16,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:16,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:16,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:26:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:16,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:16,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {1430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {1430#true} is VALID [2022-02-20 14:26:16,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1430#true} is VALID [2022-02-20 14:26:16,440 INFO L272 TraceCheckUtils]: 2: Hoare triple {1430#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {1430#true} is VALID [2022-02-20 14:26:16,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,440 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1430#true} {1430#true} #84#return; {1430#true} is VALID [2022-02-20 14:26:16,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {1430#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1430#true} is VALID [2022-02-20 14:26:16,441 INFO L272 TraceCheckUtils]: 8: Hoare triple {1430#true} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {1430#true} is VALID [2022-02-20 14:26:16,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,441 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1430#true} {1430#true} #86#return; {1430#true} is VALID [2022-02-20 14:26:16,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {1430#true} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,445 INFO L272 TraceCheckUtils]: 16: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {1430#true} is VALID [2022-02-20 14:26:16,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,446 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1430#true} {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} #88#return; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1445#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:16,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {1445#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~N~0#1); {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_~i~0#1 := 0; {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !(main_~i~0#1 < main_~N~0#1); {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_~i~0#1 := 0; {1540#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~N~0#1| 1))} is VALID [2022-02-20 14:26:16,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {1540#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~N~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {1540#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~N~0#1| 1))} is VALID [2022-02-20 14:26:16,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {1540#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~N~0#1| 1))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {1547#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~N~0#1| 1))} is VALID [2022-02-20 14:26:16,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {1547#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~N~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {1431#false} is VALID [2022-02-20 14:26:16,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {1431#false} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {1431#false} is VALID [2022-02-20 14:26:16,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {1431#false} assume !(main_~i~0#1 < main_~N~0#1); {1431#false} is VALID [2022-02-20 14:26:16,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {1431#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1431#false} is VALID [2022-02-20 14:26:16,453 INFO L290 TraceCheckUtils]: 36: Hoare triple {1431#false} assume 0 == __VERIFIER_assert_~cond#1; {1431#false} is VALID [2022-02-20 14:26:16,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-02-20 14:26:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 14:26:16,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:16,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-02-20 14:26:16,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {1431#false} assume 0 == __VERIFIER_assert_~cond#1; {1431#false} is VALID [2022-02-20 14:26:16,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {1431#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1431#false} is VALID [2022-02-20 14:26:16,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {1431#false} assume !(main_~i~0#1 < main_~N~0#1); {1431#false} is VALID [2022-02-20 14:26:16,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {1431#false} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {1431#false} is VALID [2022-02-20 14:26:16,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {1448#(<= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {1431#false} is VALID [2022-02-20 14:26:16,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {1584#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {1448#(<= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:16,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {1584#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {1584#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:16,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_~i~0#1 := 0; {1584#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:16,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !(main_~i~0#1 < main_~N~0#1); {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_~i~0#1 := 0; {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {1445#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~N~0#1); {1446#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-20 14:26:16,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1445#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:26:16,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,610 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1430#true} {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} #88#return; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,610 INFO L272 TraceCheckUtils]: 16: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {1430#true} is VALID [2022-02-20 14:26:16,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {1430#true} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {1491#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:16,611 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1430#true} {1430#true} #86#return; {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L272 TraceCheckUtils]: 8: Hoare triple {1430#true} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {1430#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1430#true} {1430#true} #84#return; {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {1430#true} assume !(0 == ~cond); {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L272 TraceCheckUtils]: 2: Hoare triple {1430#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1430#true} is VALID [2022-02-20 14:26:16,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {1430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {1430#true} is VALID [2022-02-20 14:26:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 14:26:16,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691999265] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:16,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:16,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-02-20 14:26:16,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830792874] [2022-02-20 14:26:16,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:16,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-02-20 14:26:16,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:16,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 14:26:16,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:16,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:26:16,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:16,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:26:16,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:26:16,658 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 14:26:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:16,957 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2022-02-20 14:26:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:26:16,957 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-02-20 14:26:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 14:26:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-02-20 14:26:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 14:26:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-02-20 14:26:16,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-02-20 14:26:17,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:17,044 INFO L225 Difference]: With dead ends: 88 [2022-02-20 14:26:17,044 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 14:26:17,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:26:17,045 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:17,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 103 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 14:26:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-02-20 14:26:17,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:17,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 51 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:17,068 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 51 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:17,068 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 51 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:17,070 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-02-20 14:26:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-02-20 14:26:17,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:17,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:17,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 69 states. [2022-02-20 14:26:17,072 INFO L87 Difference]: Start difference. First operand has 51 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 69 states. [2022-02-20 14:26:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:17,074 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-02-20 14:26:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-02-20 14:26:17,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:17,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:17,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:17,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:26:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-02-20 14:26:17,077 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 38 [2022-02-20 14:26:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:17,077 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-02-20 14:26:17,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 14:26:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-02-20 14:26:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 14:26:17,078 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:17,078 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:17,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:17,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:17,303 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:17,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash -7684490, now seen corresponding path program 3 times [2022-02-20 14:26:17,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:17,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691401223] [2022-02-20 14:26:17,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:17,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:17,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:17,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} #84#return; {2005#true} is VALID [2022-02-20 14:26:17,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 14:26:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:17,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2005#true} #86#return; {2005#true} is VALID [2022-02-20 14:26:17,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 14:26:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:17,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} #88#return; {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:17,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 14:26:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:17,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2005#true} {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} #88#return; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {2005#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {2005#true} is VALID [2022-02-20 14:26:17,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2005#true} is VALID [2022-02-20 14:26:17,385 INFO L272 TraceCheckUtils]: 2: Hoare triple {2005#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,385 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2005#true} {2005#true} #84#return; {2005#true} is VALID [2022-02-20 14:26:17,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {2005#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2005#true} is VALID [2022-02-20 14:26:17,386 INFO L272 TraceCheckUtils]: 8: Hoare triple {2005#true} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,386 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2005#true} {2005#true} #86#return; {2005#true} is VALID [2022-02-20 14:26:17,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {2005#true} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:17,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:17,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:17,388 INFO L272 TraceCheckUtils]: 16: Hoare triple {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,389 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2005#true} {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} #88#return; {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:17,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:17,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:17,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {2015#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2020#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {2020#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,391 INFO L272 TraceCheckUtils]: 26: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,392 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2005#true} {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} #88#return; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} main_~i~0#1 := 0; {2026#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} is VALID [2022-02-20 14:26:17,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {2026#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2026#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} is VALID [2022-02-20 14:26:17,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {2026#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2027#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {2027#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {2006#false} is VALID [2022-02-20 14:26:17,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {2006#false} main_~i~0#1 := 0; {2006#false} is VALID [2022-02-20 14:26:17,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {2006#false} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {2006#false} is VALID [2022-02-20 14:26:17,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#false} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2006#false} is VALID [2022-02-20 14:26:17,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {2006#false} assume !(main_~i~0#1 < main_~N~0#1); {2006#false} is VALID [2022-02-20 14:26:17,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {2006#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2006#false} is VALID [2022-02-20 14:26:17,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {2006#false} assume 0 == __VERIFIER_assert_~cond#1; {2006#false} is VALID [2022-02-20 14:26:17,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {2006#false} assume !false; {2006#false} is VALID [2022-02-20 14:26:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 14:26:17,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:17,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691401223] [2022-02-20 14:26:17,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691401223] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:17,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70002910] [2022-02-20 14:26:17,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:26:17,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:17,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:17,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:17,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:26:17,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:26:17,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:17,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:26:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:17,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:17,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {2005#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {2005#true} is VALID [2022-02-20 14:26:17,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2005#true} is VALID [2022-02-20 14:26:17,680 INFO L272 TraceCheckUtils]: 2: Hoare triple {2005#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,680 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2005#true} {2005#true} #84#return; {2005#true} is VALID [2022-02-20 14:26:17,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {2005#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2005#true} is VALID [2022-02-20 14:26:17,680 INFO L272 TraceCheckUtils]: 8: Hoare triple {2005#true} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,681 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2005#true} {2005#true} #86#return; {2005#true} is VALID [2022-02-20 14:26:17,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {2005#true} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,688 INFO L272 TraceCheckUtils]: 16: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,689 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2005#true} {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} #88#return; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2020#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {2020#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,692 INFO L272 TraceCheckUtils]: 26: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,693 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2005#true} {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} #88#return; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} main_~i~0#1 := 0; {2137#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} is VALID [2022-02-20 14:26:17,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {2137#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2137#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} is VALID [2022-02-20 14:26:17,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {2137#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2144#(and (<= 2 |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:17,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {2144#(and (<= 2 |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < main_~N~0#1); {2006#false} is VALID [2022-02-20 14:26:17,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {2006#false} main_~i~0#1 := 0; {2006#false} is VALID [2022-02-20 14:26:17,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {2006#false} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {2006#false} is VALID [2022-02-20 14:26:17,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#false} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2006#false} is VALID [2022-02-20 14:26:17,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {2006#false} assume !(main_~i~0#1 < main_~N~0#1); {2006#false} is VALID [2022-02-20 14:26:17,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {2006#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2006#false} is VALID [2022-02-20 14:26:17,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {2006#false} assume 0 == __VERIFIER_assert_~cond#1; {2006#false} is VALID [2022-02-20 14:26:17,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {2006#false} assume !false; {2006#false} is VALID [2022-02-20 14:26:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 14:26:17,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:17,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {2006#false} assume !false; {2006#false} is VALID [2022-02-20 14:26:17,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {2006#false} assume 0 == __VERIFIER_assert_~cond#1; {2006#false} is VALID [2022-02-20 14:26:17,883 INFO L290 TraceCheckUtils]: 43: Hoare triple {2006#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2006#false} is VALID [2022-02-20 14:26:17,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {2006#false} assume !(main_~i~0#1 < main_~N~0#1); {2006#false} is VALID [2022-02-20 14:26:17,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {2006#false} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2006#false} is VALID [2022-02-20 14:26:17,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {2006#false} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {2006#false} is VALID [2022-02-20 14:26:17,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {2006#false} main_~i~0#1 := 0; {2006#false} is VALID [2022-02-20 14:26:17,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {2027#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {2006#false} is VALID [2022-02-20 14:26:17,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {2193#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~N~0#1|)} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2027#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~N~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2193#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} main_~i~0#1 := 0; {2193#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,888 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2005#true} {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} #88#return; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,889 INFO L272 TraceCheckUtils]: 26: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {2020#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2021#(<= 2 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-20 14:26:17,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2020#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,892 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2005#true} {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} #88#return; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,893 INFO L272 TraceCheckUtils]: 16: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {2005#true} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {2070#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:26:17,894 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2005#true} {2005#true} #86#return; {2005#true} is VALID [2022-02-20 14:26:17,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,895 INFO L272 TraceCheckUtils]: 8: Hoare triple {2005#true} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {2005#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2005#true} is VALID [2022-02-20 14:26:17,895 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2005#true} {2005#true} #84#return; {2005#true} is VALID [2022-02-20 14:26:17,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {2005#true} assume true; {2005#true} is VALID [2022-02-20 14:26:17,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {2005#true} assume !(0 == ~cond); {2005#true} is VALID [2022-02-20 14:26:17,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {2005#true} ~cond := #in~cond; {2005#true} is VALID [2022-02-20 14:26:17,896 INFO L272 TraceCheckUtils]: 2: Hoare triple {2005#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {2005#true} is VALID [2022-02-20 14:26:17,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {2005#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2005#true} is VALID [2022-02-20 14:26:17,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {2005#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {2005#true} is VALID [2022-02-20 14:26:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-20 14:26:17,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70002910] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:17,897 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:26:17,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-02-20 14:26:17,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206750991] [2022-02-20 14:26:17,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 46 [2022-02-20 14:26:17,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:17,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:26:17,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:17,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:26:17,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:17,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:26:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:26:17,942 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:26:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:18,316 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-02-20 14:26:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:26:18,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 46 [2022-02-20 14:26:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:26:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-02-20 14:26:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:26:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-02-20 14:26:18,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 59 transitions. [2022-02-20 14:26:18,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:18,384 INFO L225 Difference]: With dead ends: 59 [2022-02-20 14:26:18,384 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 14:26:18,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:26:18,387 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:18,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 14:26:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2022-02-20 14:26:18,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:18,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 39 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:26:18,421 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 39 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:26:18,421 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 39 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:26:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:18,423 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-02-20 14:26:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-02-20 14:26:18,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:18,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:18,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 51 states. [2022-02-20 14:26:18,424 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 51 states. [2022-02-20 14:26:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:18,426 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-02-20 14:26:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-02-20 14:26:18,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:18,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:18,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:18,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 14:26:18,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-02-20 14:26:18,428 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 46 [2022-02-20 14:26:18,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:18,429 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-02-20 14:26:18,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 14:26:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-20 14:26:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 14:26:18,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:18,430 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:18,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:18,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:18,643 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1064283002, now seen corresponding path program 4 times [2022-02-20 14:26:18,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:18,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710430795] [2022-02-20 14:26:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:18,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:19,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:19,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:19,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:19,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2546#true} {2546#true} #84#return; {2546#true} is VALID [2022-02-20 14:26:19,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 14:26:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:19,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:19,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:19,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:19,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2546#true} {2552#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {2552#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:19,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 14:26:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:19,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:19,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:19,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:19,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2546#true} {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 14:26:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:19,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:19,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:19,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:19,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2546#true} {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} #88#return; {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:19,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {2546#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {2546#true} is VALID [2022-02-20 14:26:19,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2546#true} is VALID [2022-02-20 14:26:19,411 INFO L272 TraceCheckUtils]: 2: Hoare triple {2546#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {2546#true} is VALID [2022-02-20 14:26:19,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:19,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:19,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:19,412 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2546#true} {2546#true} #84#return; {2546#true} is VALID [2022-02-20 14:26:19,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2552#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:19,412 INFO L272 TraceCheckUtils]: 8: Hoare triple {2552#(= |ULTIMATE.start_main_~k~0#1| 0)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {2546#true} is VALID [2022-02-20 14:26:19,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:19,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:19,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:19,414 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2546#true} {2552#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {2552#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:19,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {2552#(= |ULTIMATE.start_main_~k~0#1| 0)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:19,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:19,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:19,416 INFO L272 TraceCheckUtils]: 16: Hoare triple {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 14:26:19,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:19,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:19,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:19,417 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2546#true} {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:19,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:19,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {2557#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2562#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:19,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {2562#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:19,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:19,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:19,421 INFO L272 TraceCheckUtils]: 26: Hoare triple {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 14:26:19,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:19,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:19,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:19,422 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2546#true} {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} #88#return; {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:19,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {2563#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2568#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) |ULTIMATE.start_main_#t~mem10#1|)) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:19,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {2568#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) |ULTIMATE.start_main_#t~mem10#1|)) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2569#(and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:19,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {2569#(and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2570#(and (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~i~0#1| 2)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~i~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:19,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {2570#(and (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~i~0#1| 2)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~i~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~i~0#1 < main_~N~0#1); {2571#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~N~0#1| 2)))} is VALID [2022-02-20 14:26:19,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {2571#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~N~0#1| 2)))} main_~i~0#1 := 0; {2572#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~N~0#1| 2)))} is VALID [2022-02-20 14:26:19,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {2572#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~N~0#1| 2)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2573#(and (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (< |ULTIMATE.start_main_~N~0#1| 2)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:19,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {2573#(and (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (< |ULTIMATE.start_main_~N~0#1| 2)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2574#(and (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (<= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~N~0#1| 4)) (+ |ULTIMATE.start_main_~#b~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) (and (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} is VALID [2022-02-20 14:26:19,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {2574#(and (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (<= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~N~0#1| 4)) (+ |ULTIMATE.start_main_~#b~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) (and (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2575#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (and (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 4) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (= |ULTIMATE.start_main_~k~0#1| 0)) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} is VALID [2022-02-20 14:26:19,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {2575#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (and (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 4) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (= |ULTIMATE.start_main_~k~0#1| 0)) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2576#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4)))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} is VALID [2022-02-20 14:26:19,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {2576#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4)))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} assume !(main_~i~0#1 < main_~N~0#1); {2576#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4)))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} is VALID [2022-02-20 14:26:19,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {2576#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4)))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} main_~i~0#1 := 0; {2577#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} is VALID [2022-02-20 14:26:19,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {2577#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (and (= |ULTIMATE.start_main_~k~0#1| 0) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {2578#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) |ULTIMATE.start_main_~k~0#1|)) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} is VALID [2022-02-20 14:26:19,434 INFO L290 TraceCheckUtils]: 43: Hoare triple {2578#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) |ULTIMATE.start_main_~k~0#1|)) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2579#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (* |ULTIMATE.start_main_~N~0#1| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) (<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))} is VALID [2022-02-20 14:26:19,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {2579#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (* |ULTIMATE.start_main_~N~0#1| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) (<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:19,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:19,435 INFO L290 TraceCheckUtils]: 46: Hoare triple {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:19,436 INFO L290 TraceCheckUtils]: 47: Hoare triple {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2581#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:19,436 INFO L290 TraceCheckUtils]: 48: Hoare triple {2581#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {2547#false} is VALID [2022-02-20 14:26:19,436 INFO L290 TraceCheckUtils]: 49: Hoare triple {2547#false} assume !false; {2547#false} is VALID [2022-02-20 14:26:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 14:26:19,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:19,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710430795] [2022-02-20 14:26:19,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710430795] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:19,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96513144] [2022-02-20 14:26:19,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:26:19,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:19,440 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:19,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:26:19,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:26:19,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:19,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-20 14:26:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:19,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:19,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-02-20 14:26:20,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:20,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:20,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:26:20,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-02-20 14:26:20,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:20,629 INFO L390 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 0 case distinctions, treesize of input 42 treesize of output 39 [2022-02-20 14:26:21,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2022-02-20 14:26:21,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {2546#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {2546#true} is VALID [2022-02-20 14:26:21,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2546#true} is VALID [2022-02-20 14:26:21,385 INFO L272 TraceCheckUtils]: 2: Hoare triple {2546#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {2546#true} is VALID [2022-02-20 14:26:21,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:21,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:21,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:21,385 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2546#true} {2546#true} #84#return; {2546#true} is VALID [2022-02-20 14:26:21,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2606#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:21,385 INFO L272 TraceCheckUtils]: 8: Hoare triple {2606#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {2546#true} is VALID [2022-02-20 14:26:21,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:21,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:21,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:21,386 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2546#true} {2606#(<= 0 |ULTIMATE.start_main_~k~0#1|)} #86#return; {2606#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:21,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {2606#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,388 INFO L272 TraceCheckUtils]: 16: Hoare triple {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 14:26:21,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:21,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:21,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:21,389 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2546#true} {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {2625#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2653#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {2653#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2657#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {2657#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {2657#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {2657#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {2657#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,391 INFO L272 TraceCheckUtils]: 26: Hoare triple {2657#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 14:26:21,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 14:26:21,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 14:26:21,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 14:26:21,392 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2546#true} {2657#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {2657#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {2657#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {2682#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem10#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:21,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {2682#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem10#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {2686#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:21,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {2686#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {2686#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:21,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {2686#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~N~0#1); {2686#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:21,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {2686#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} main_~i~0#1 := 0; {2696#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:21,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {2696#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2700#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:21,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {2700#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2704#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~j~0#1|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:21,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {2704#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~j~0#1|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {2708#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} is VALID [2022-02-20 14:26:21,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {2708#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2708#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} is VALID [2022-02-20 14:26:21,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {2708#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~N~0#1); {2708#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} is VALID [2022-02-20 14:26:21,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {2708#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} main_~i~0#1 := 0; {2718#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} is VALID [2022-02-20 14:26:21,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {2718#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {2722#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~i~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:21,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {2722#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~i~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) |ULTIMATE.start_main_~k~0#1|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2726#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:21,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {2726#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:21,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:21,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:21,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {2580#(<= 2 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2739#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:21,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {2739#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2547#false} is VALID [2022-02-20 14:26:21,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {2547#false} assume !false; {2547#false} is VALID [2022-02-20 14:26:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 14:26:21,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:31,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96513144] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:31,614 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:26:31,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2022-02-20 14:26:31,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752419063] [2022-02-20 14:26:31,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:31,615 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 50 [2022-02-20 14:26:31,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:31,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:31,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:31,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-20 14:26:31,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:31,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-20 14:26:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1704, Unknown=4, NotChecked=0, Total=1892 [2022-02-20 14:26:31,687 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:34,731 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2022-02-20 14:26:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-20 14:26:34,732 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 50 [2022-02-20 14:26:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 115 transitions. [2022-02-20 14:26:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 115 transitions. [2022-02-20 14:26:34,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 115 transitions. [2022-02-20 14:26:34,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:34,873 INFO L225 Difference]: With dead ends: 95 [2022-02-20 14:26:34,873 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 14:26:34,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=532, Invalid=3886, Unknown=4, NotChecked=0, Total=4422 [2022-02-20 14:26:34,875 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 70 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:34,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 281 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 624 Invalid, 0 Unknown, 71 Unchecked, 0.7s Time] [2022-02-20 14:26:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 14:26:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2022-02-20 14:26:34,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:34,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:34,951 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:34,951 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:34,954 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2022-02-20 14:26:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-02-20 14:26:34,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:34,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:34,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 91 states. [2022-02-20 14:26:34,955 INFO L87 Difference]: Start difference. First operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 91 states. [2022-02-20 14:26:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:34,958 INFO L93 Difference]: Finished difference Result 91 states and 117 transitions. [2022-02-20 14:26:34,958 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-02-20 14:26:34,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:34,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:34,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:34,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2022-02-20 14:26:34,961 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 50 [2022-02-20 14:26:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:34,962 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2022-02-20 14:26:34,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-02-20 14:26:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 14:26:34,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:34,963 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:34,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:35,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:35,176 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:35,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash -929861704, now seen corresponding path program 1 times [2022-02-20 14:26:35,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:35,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47362606] [2022-02-20 14:26:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:35,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:35,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:35,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:35,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3266#true} {3266#true} #84#return; {3266#true} is VALID [2022-02-20 14:26:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 14:26:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:35,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:35,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:35,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:35,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3266#true} {3272#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {3272#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:35,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 14:26:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:35,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:35,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:35,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:35,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3266#true} {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:35,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 14:26:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:35,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:35,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:35,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:35,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3266#true} {3284#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} #88#return; {3284#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:35,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {3266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {3266#true} is VALID [2022-02-20 14:26:35,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3266#true} is VALID [2022-02-20 14:26:35,998 INFO L272 TraceCheckUtils]: 2: Hoare triple {3266#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {3266#true} is VALID [2022-02-20 14:26:35,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:35,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:35,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:35,999 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3266#true} {3266#true} #84#return; {3266#true} is VALID [2022-02-20 14:26:35,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {3266#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3272#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:35,999 INFO L272 TraceCheckUtils]: 8: Hoare triple {3272#(= |ULTIMATE.start_main_~k~0#1| 0)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {3266#true} is VALID [2022-02-20 14:26:36,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:36,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:36,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:36,000 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3266#true} {3272#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {3272#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:36,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {3272#(= |ULTIMATE.start_main_~k~0#1| 0)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:36,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:36,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:36,002 INFO L272 TraceCheckUtils]: 16: Hoare triple {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {3266#true} is VALID [2022-02-20 14:26:36,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:36,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:36,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:36,003 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3266#true} {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:36,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:36,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {3277#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {3282#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:36,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {3282#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3283#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:36,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {3283#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {3284#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:36,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {3284#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:36,006 INFO L272 TraceCheckUtils]: 26: Hoare triple {3284#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {3266#true} is VALID [2022-02-20 14:26:36,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:36,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:36,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:36,007 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3266#true} {3284#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} #88#return; {3284#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:36,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {3284#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3289#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_#t~mem10#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:36,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {3289#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (<= (+ |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_#t~mem10#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~j~0#1 > main_#t~mem10#1);havoc main_#t~mem10#1; {3290#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= (* 2 |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:36,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {3290#(and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~N~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= (* 2 |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3291#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (or (and (<= (* 2 |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~N~0#1| 4))))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< 2 |ULTIMATE.start_main_~N~0#1|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} is VALID [2022-02-20 14:26:36,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {3291#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (or (and (<= (* 2 |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~N~0#1| 4))))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< 2 |ULTIMATE.start_main_~N~0#1|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} assume !(main_~i~0#1 < main_~N~0#1); {3291#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (or (and (<= (* 2 |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~N~0#1| 4))))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< 2 |ULTIMATE.start_main_~N~0#1|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} is VALID [2022-02-20 14:26:36,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {3291#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (or (and (<= (* 2 |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~N~0#1| 4))))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< 2 |ULTIMATE.start_main_~N~0#1|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} main_~i~0#1 := 0; {3292#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|) (or (and (<= (* 2 |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~N~0#1| 4))))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< 2 |ULTIMATE.start_main_~N~0#1|)))} is VALID [2022-02-20 14:26:36,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {3292#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|) (or (and (<= (* 2 |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~N~0#1| 4))))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< 2 |ULTIMATE.start_main_~N~0#1|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3293#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~N~0#1| 4))))) (< 2 |ULTIMATE.start_main_~N~0#1|)) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} is VALID [2022-02-20 14:26:36,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {3293#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (- 4) (* |ULTIMATE.start_main_~N~0#1| 4))))) (< 2 |ULTIMATE.start_main_~N~0#1|)) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~N~0#1|))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3294#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 5 (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~N~0#1| 4))) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~N~0#1|)) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} is VALID [2022-02-20 14:26:36,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {3294#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 5 (* |ULTIMATE.start_main_~i~0#1| 4)) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~N~0#1| 4))) (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (<= |ULTIMATE.start_main_~j~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~N~0#1|)) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3295#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 5 (* |ULTIMATE.start_main_~i~0#1| 4)) (* |ULTIMATE.start_main_~N~0#1| 4)) (and (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 4) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))))} is VALID [2022-02-20 14:26:36,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {3295#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| 5 (* |ULTIMATE.start_main_~i~0#1| 4)) (* |ULTIMATE.start_main_~N~0#1| 4)) (and (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 4) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3296#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1) (* |ULTIMATE.start_main_~N~0#1| 4)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4))) (= |ULTIMATE.start_main_~k~0#1| 0))))} is VALID [2022-02-20 14:26:36,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {3296#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1) (* |ULTIMATE.start_main_~N~0#1| 4)) (and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4))) (= |ULTIMATE.start_main_~k~0#1| 0))))} assume !(main_~i~0#1 < main_~N~0#1); {3297#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4))) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:26:36,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {3297#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4))) (= |ULTIMATE.start_main_~k~0#1| 0))} main_~i~0#1 := 0; {3298#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1)))} is VALID [2022-02-20 14:26:36,018 INFO L290 TraceCheckUtils]: 42: Hoare triple {3298#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {3299#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) |ULTIMATE.start_main_~k~0#1| 1)))} is VALID [2022-02-20 14:26:36,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {3299#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) |ULTIMATE.start_main_~k~0#1| 1)))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3300#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))} is VALID [2022-02-20 14:26:36,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {3300#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:36,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:36,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:36,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3302#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:36,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {3302#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {3267#false} is VALID [2022-02-20 14:26:36,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {3267#false} assume !false; {3267#false} is VALID [2022-02-20 14:26:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 14:26:36,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:36,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47362606] [2022-02-20 14:26:36,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47362606] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:36,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082361427] [2022-02-20 14:26:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:36,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:36,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:36,024 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:36,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 14:26:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:36,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 14:26:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:36,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:36,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 14:26:36,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:36,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:36,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:26:36,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2022-02-20 14:26:37,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:37,092 INFO L390 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 0 case distinctions, treesize of input 51 treesize of output 44 [2022-02-20 14:26:37,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-02-20 14:26:37,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {3266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {3266#true} is VALID [2022-02-20 14:26:37,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3266#true} is VALID [2022-02-20 14:26:37,890 INFO L272 TraceCheckUtils]: 2: Hoare triple {3266#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {3266#true} is VALID [2022-02-20 14:26:37,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:37,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:37,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:37,891 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3266#true} {3266#true} #84#return; {3266#true} is VALID [2022-02-20 14:26:37,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {3266#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:37,903 INFO L272 TraceCheckUtils]: 8: Hoare triple {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {3266#true} is VALID [2022-02-20 14:26:37,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:37,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:37,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:37,904 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3266#true} {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} #86#return; {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:37,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {3301#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,907 INFO L272 TraceCheckUtils]: 16: Hoare triple {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {3266#true} is VALID [2022-02-20 14:26:37,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:37,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:37,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:37,908 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3266#true} {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {3345#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {3373#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {3373#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3377#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {3377#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {3377#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {3377#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {3377#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,911 INFO L272 TraceCheckUtils]: 26: Hoare triple {3377#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {3266#true} is VALID [2022-02-20 14:26:37,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-02-20 14:26:37,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-02-20 14:26:37,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-02-20 14:26:37,912 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3266#true} {3377#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {3377#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {3377#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3402#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:37,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {3402#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !(main_~j~0#1 > main_#t~mem10#1);havoc main_#t~mem10#1; {3406#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:37,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {3406#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3406#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:37,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {3406#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~N~0#1); {3406#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:37,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {3406#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} main_~i~0#1 := 0; {3416#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:37,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {3416#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3420#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:37,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {3420#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3424#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~j~0#1|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:37,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {3424#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~j~0#1|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3428#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:37,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {3428#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3428#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:37,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {3428#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} assume !(main_~i~0#1 < main_~N~0#1); {3428#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:37,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {3428#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} main_~i~0#1 := 0; {3438#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:37,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {3438#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {3442#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= (+ |ULTIMATE.start_main_~i~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) |ULTIMATE.start_main_~k~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:37,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {3442#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= (+ |ULTIMATE.start_main_~i~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) |ULTIMATE.start_main_~k~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3446#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} is VALID [2022-02-20 14:26:37,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {3446#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {3450#(<= 1 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:37,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {3450#(<= 1 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3450#(<= 1 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:37,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {3450#(<= 1 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {3450#(<= 1 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:37,931 INFO L290 TraceCheckUtils]: 47: Hoare triple {3450#(<= 1 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3460#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:37,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {3460#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3267#false} is VALID [2022-02-20 14:26:37,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {3267#false} assume !false; {3267#false} is VALID [2022-02-20 14:26:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 14:26:37,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:46,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082361427] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:46,525 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:26:46,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 35 [2022-02-20 14:26:46,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527722147] [2022-02-20 14:26:46,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 50 [2022-02-20 14:26:46,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:46,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:46,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:46,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-20 14:26:46,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-20 14:26:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1767, Unknown=4, NotChecked=0, Total=1980 [2022-02-20 14:26:46,594 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:49,017 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2022-02-20 14:26:49,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 14:26:49,017 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 50 [2022-02-20 14:26:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2022-02-20 14:26:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2022-02-20 14:26:49,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 80 transitions. [2022-02-20 14:26:49,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:49,096 INFO L225 Difference]: With dead ends: 93 [2022-02-20 14:26:49,096 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 14:26:49,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=427, Invalid=2991, Unknown=4, NotChecked=0, Total=3422 [2022-02-20 14:26:49,098 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:49,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 335 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 663 Invalid, 0 Unknown, 176 Unchecked, 0.7s Time] [2022-02-20 14:26:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 14:26:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2022-02-20 14:26:49,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:49,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:49,193 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:49,194 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:49,196 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-02-20 14:26:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-02-20 14:26:49,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:49,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:49,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 89 states. [2022-02-20 14:26:49,197 INFO L87 Difference]: Start difference. First operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 89 states. [2022-02-20 14:26:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:49,199 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-02-20 14:26:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-02-20 14:26:49,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:49,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:49,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:49,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:26:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2022-02-20 14:26:49,202 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 50 [2022-02-20 14:26:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:49,203 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2022-02-20 14:26:49,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:26:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-02-20 14:26:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 14:26:49,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:49,204 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:49,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:49,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:49,419 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 554809912, now seen corresponding path program 2 times [2022-02-20 14:26:49,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:49,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534083793] [2022-02-20 14:26:49,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:50,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:26:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:50,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:50,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:50,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:50,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3965#true} {3965#true} #84#return; {3965#true} is VALID [2022-02-20 14:26:50,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 14:26:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:50,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:50,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:50,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:50,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3965#true} {3971#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {3971#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:50,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 14:26:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:50,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:50,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:50,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:50,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3965#true} {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 14:26:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:50,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:50,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:50,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:50,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3965#true} {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} #88#return; {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:50,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {3965#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {3965#true} is VALID [2022-02-20 14:26:50,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3965#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3965#true} is VALID [2022-02-20 14:26:50,169 INFO L272 TraceCheckUtils]: 2: Hoare triple {3965#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {3965#true} is VALID [2022-02-20 14:26:50,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:50,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:50,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:50,170 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3965#true} {3965#true} #84#return; {3965#true} is VALID [2022-02-20 14:26:50,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {3965#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3971#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:50,171 INFO L272 TraceCheckUtils]: 8: Hoare triple {3971#(= |ULTIMATE.start_main_~k~0#1| 0)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {3965#true} is VALID [2022-02-20 14:26:50,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:50,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:50,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:50,171 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3965#true} {3971#(= |ULTIMATE.start_main_~k~0#1| 0)} #86#return; {3971#(= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-20 14:26:50,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {3971#(= |ULTIMATE.start_main_~k~0#1| 0)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:50,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:50,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:50,174 INFO L272 TraceCheckUtils]: 16: Hoare triple {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {3965#true} is VALID [2022-02-20 14:26:50,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:50,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:50,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:50,175 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3965#true} {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:50,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {3976#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3981#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:50,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {3981#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !(main_~j~0#1 > main_#t~mem10#1);havoc main_#t~mem10#1; {3982#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:50,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {3982#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:50,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:50,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:50,178 INFO L272 TraceCheckUtils]: 26: Hoare triple {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {3965#true} is VALID [2022-02-20 14:26:50,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:50,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:50,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:50,179 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3965#true} {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} #88#return; {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:50,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {3983#(and (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {3988#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) |ULTIMATE.start_main_#t~mem10#1|)) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:50,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {3988#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~j~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) |ULTIMATE.start_main_#t~mem10#1|)) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {3989#(and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:50,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {3989#(and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {3990#(and (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~i~0#1| 2)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~i~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:50,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {3990#(and (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~i~0#1| 2)) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~i~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !(main_~i~0#1 < main_~N~0#1); {3991#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~N~0#1| 2)))} is VALID [2022-02-20 14:26:50,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {3991#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~N~0#1| 2)))} main_~i~0#1 := 0; {3992#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~N~0#1| 2)))} is VALID [2022-02-20 14:26:50,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {3992#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (or (and (<= (+ (* 2 |ULTIMATE.start_main_~j~0#1|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) (< |ULTIMATE.start_main_~N~0#1| 2)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3993#(and (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (< |ULTIMATE.start_main_~N~0#1| 2)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:50,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {3993#(and (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (< |ULTIMATE.start_main_~N~0#1| 2)) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~N~0#1| 2) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3994#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|) (and (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (not (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))) (or (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~N~0#1| 4)) (+ |ULTIMATE.start_main_~#b~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) (and (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} is VALID [2022-02-20 14:26:50,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {3994#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= |ULTIMATE.start_main_~N~0#1| |ULTIMATE.start_main_~i~0#1|) (and (<= (+ |ULTIMATE.start_main_~j~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (not (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0)))) (or (<= (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~N~0#1| 4)) (+ |ULTIMATE.start_main_~#b~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) (and (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (= (+ |ULTIMATE.start_main_~#a~0#1.offset| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))) (= |ULTIMATE.start_main_~k~0#1| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {3995#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (or (and (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 4) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} is VALID [2022-02-20 14:26:50,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {3995#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (or (and (= (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 4) (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3996#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (or (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} is VALID [2022-02-20 14:26:50,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {3996#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (or (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} assume !(main_~i~0#1 < main_~N~0#1); {3996#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (or (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} is VALID [2022-02-20 14:26:50,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {3996#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (= |ULTIMATE.start_main_~k~0#1| 0) (or (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} main_~i~0#1 := 0; {3997#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)) (= |ULTIMATE.start_main_~k~0#1| 0))} is VALID [2022-02-20 14:26:50,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {3997#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (<= 1 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)) (= |ULTIMATE.start_main_~k~0#1| 0))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {3998#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) |ULTIMATE.start_main_~k~0#1|)) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} is VALID [2022-02-20 14:26:50,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {3998#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (* |ULTIMATE.start_main_~N~0#1| 4) 8) (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) 4) |ULTIMATE.start_main_~k~0#1|)) (< (* |ULTIMATE.start_main_~N~0#1| 4) 8)))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {3999#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (* |ULTIMATE.start_main_~N~0#1| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) (<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))} is VALID [2022-02-20 14:26:50,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {3999#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (or (<= (* |ULTIMATE.start_main_~N~0#1| 4) (+ |ULTIMATE.start_main_~#b~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) (<= 2 (+ |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~k~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:50,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:50,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:50,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4001#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:26:50,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {4001#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {3966#false} is VALID [2022-02-20 14:26:50,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {3966#false} assume !false; {3966#false} is VALID [2022-02-20 14:26:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 14:26:50,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:50,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534083793] [2022-02-20 14:26:50,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534083793] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:26:50,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005163051] [2022-02-20 14:26:50,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:50,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:50,196 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:50,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 14:26:50,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:50,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:50,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-20 14:26:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:50,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:50,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 14:26:50,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:50,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:50,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:26:50,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-02-20 14:26:51,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:51,187 INFO L390 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 0 case distinctions, treesize of input 42 treesize of output 39 [2022-02-20 14:26:51,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2022-02-20 14:26:51,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {3965#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3); {3965#true} is VALID [2022-02-20 14:26:51,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {3965#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~short9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post6#1, main_#t~mem13#1, main_#t~post12#1, main_#t~mem15#1, main_#t~post14#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~N~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~j~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3965#true} is VALID [2022-02-20 14:26:51,887 INFO L272 TraceCheckUtils]: 2: Hoare triple {3965#true} call assume_abort_if_not((if main_~j~0#1 < 10000 && main_~j~0#1 > -10000 then 1 else 0)); {3965#true} is VALID [2022-02-20 14:26:51,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:51,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:51,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:51,888 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3965#true} {3965#true} #84#return; {3965#true} is VALID [2022-02-20 14:26:51,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {3965#true} main_~k~0#1 := 0;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {4026#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:51,888 INFO L272 TraceCheckUtils]: 8: Hoare triple {4026#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call assume_abort_if_not((if main_~N~0#1 < 10000 && main_~N~0#1 > -10000 then 1 else 0)); {3965#true} is VALID [2022-02-20 14:26:51,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:51,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:51,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:51,889 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3965#true} {4026#(<= 0 |ULTIMATE.start_main_~k~0#1|)} #86#return; {4026#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:51,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {4026#(<= 0 |ULTIMATE.start_main_~k~0#1|)} call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4 * (1 + main_~N~0#1));call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4 * main_~N~0#1);main_~i~0#1 := 0; {4045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {4045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {4045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {4045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {4045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,890 INFO L272 TraceCheckUtils]: 16: Hoare triple {4045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {3965#true} is VALID [2022-02-20 14:26:51,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:51,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:51,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:51,891 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3965#true} {4045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {4045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {4045#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4070#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {4070#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !(main_~j~0#1 > main_#t~mem10#1);havoc main_#t~mem10#1; {4074#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {4074#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4078#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {4078#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem7#1 < 10000; {4078#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {4078#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short9#1 := main_#t~mem8#1 > -10000; {4078#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,896 INFO L272 TraceCheckUtils]: 26: Hoare triple {4078#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} call assume_abort_if_not((if main_#t~short9#1 then 1 else 0)); {3965#true} is VALID [2022-02-20 14:26:51,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {3965#true} ~cond := #in~cond; {3965#true} is VALID [2022-02-20 14:26:51,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {3965#true} assume !(0 == ~cond); {3965#true} is VALID [2022-02-20 14:26:51,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {3965#true} assume true; {3965#true} is VALID [2022-02-20 14:26:51,897 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3965#true} {4078#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} #88#return; {4078#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {4078#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;call main_#t~mem10#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {4103#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem10#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} is VALID [2022-02-20 14:26:51,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {4103#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem10#1|) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))} assume main_~j~0#1 > main_#t~mem10#1;havoc main_#t~mem10#1;call main_#t~mem11#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_~j~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1; {4107#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:51,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {4107#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {4107#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:51,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {4107#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~N~0#1); {4107#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:51,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {4107#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} main_~i~0#1 := 0; {4117#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:51,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {4117#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {4121#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:26:51,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {4121#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (+ |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4125#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~j~0#1|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} is VALID [2022-02-20 14:26:51,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {4125#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~j~0#1|)) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)) (<= |ULTIMATE.start_main_~j~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem13#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem13#1 - main_~j~0#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~mem13#1; {4129#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} is VALID [2022-02-20 14:26:51,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {4129#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4129#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} is VALID [2022-02-20 14:26:51,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {4129#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} assume !(main_~i~0#1 < main_~N~0#1); {4129#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} is VALID [2022-02-20 14:26:51,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {4129#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} main_~i~0#1 := 0; {4139#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} is VALID [2022-02-20 14:26:51,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {4139#(and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {4143#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~i~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 14:26:51,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {4143#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (<= (+ |ULTIMATE.start_main_~i~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) |ULTIMATE.start_main_~k~0#1|))} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {4147#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:51,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {4147#(and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|) |ULTIMATE.start_main_~k~0#1|) (exists ((|ULTIMATE.start_main_~#a~0#1.base| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 4) (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) |ULTIMATE.start_main_~#b~0#1.offset|))) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|)))) (<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~N~0#1);call main_#t~mem15#1 := read~int(main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4);main_~k~0#1 := main_~k~0#1 + main_#t~mem15#1 + main_~i~0#1;havoc main_#t~mem15#1; {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:51,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} main_#t~post14#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1; {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:51,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} assume !(main_~i~0#1 < main_~N~0#1); {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-20 14:26:51,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {4000#(<= 2 |ULTIMATE.start_main_~k~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4160#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:26:51,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {4160#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3966#false} is VALID [2022-02-20 14:26:51,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {3966#false} assume !false; {3966#false} is VALID [2022-02-20 14:26:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 14:26:51,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:27:04,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005163051] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:27:04,412 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:27:04,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 36 [2022-02-20 14:27:04,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649030733] [2022-02-20 14:27:04,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:27:04,414 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 50 [2022-02-20 14:27:04,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:27:04,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:27:04,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:04,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-20 14:27:04,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:27:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-20 14:27:04,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1863, Unknown=5, NotChecked=0, Total=2070 [2022-02-20 14:27:04,481 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:27:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:07,988 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2022-02-20 14:27:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-20 14:27:07,988 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 50 [2022-02-20 14:27:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:27:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:27:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 105 transitions. [2022-02-20 14:27:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:27:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 105 transitions. [2022-02-20 14:27:08,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 105 transitions. [2022-02-20 14:27:08,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:27:08,115 INFO L225 Difference]: With dead ends: 150 [2022-02-20 14:27:08,115 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 14:27:08,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=539, Invalid=3878, Unknown=5, NotChecked=0, Total=4422 [2022-02-20 14:27:08,119 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 83 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 14:27:08,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 268 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 841 Invalid, 0 Unknown, 122 Unchecked, 0.9s Time] [2022-02-20 14:27:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 14:27:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 72. [2022-02-20 14:27:08,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:27:08,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 72 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:27:08,219 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 72 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:27:08,219 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 72 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:27:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,224 INFO L93 Difference]: Finished difference Result 146 states and 188 transitions. [2022-02-20 14:27:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2022-02-20 14:27:08,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 146 states. [2022-02-20 14:27:08,225 INFO L87 Difference]: Start difference. First operand has 72 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 146 states. [2022-02-20 14:27:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:27:08,228 INFO L93 Difference]: Finished difference Result 146 states and 188 transitions. [2022-02-20 14:27:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2022-02-20 14:27:08,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:27:08,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:27:08,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:27:08,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:27:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:27:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2022-02-20 14:27:08,231 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 50 [2022-02-20 14:27:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:27:08,232 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2022-02-20 14:27:08,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 14:27:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2022-02-20 14:27:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 14:27:08,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:27:08,233 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:27:08,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 14:27:08,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:27:08,456 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:27:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:27:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1439334794, now seen corresponding path program 2 times [2022-02-20 14:27:08,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:27:08,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217916990] [2022-02-20 14:27:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:27:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:27:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat