./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/insertion_sort-2.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/loops/insertion_sort-2.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 e6909fdbd47ee7cc9ac1cfcb139a86d0e022eb1f9eab8a625d6818fa3999b29d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:59:13,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:59:13,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:59:13,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:59:13,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:59:13,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:59:13,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:59:13,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:59:13,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:59:13,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:59:13,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:59:13,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:59:13,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:59:13,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:59:13,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:59:13,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:59:13,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:59:13,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:59:13,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:59:13,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:59:13,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:59:13,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:59:13,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:59:13,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:59:13,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:59:13,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:59:13,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:59:13,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:59:13,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:59:13,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:59:13,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:59:13,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:59:13,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:59:13,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:59:13,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:59:13,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:59:13,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:59:13,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:59:13,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:59:13,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:59:13,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:59:13,474 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:59:13,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:59:13,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:59:13,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:59:13,496 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:59:13,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:59:13,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:59:13,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:59:13,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:59:13,498 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:59:13,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:59:13,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:59:13,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:59:13,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:59:13,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:59:13,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:59:13,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:59:13,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:59:13,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:59:13,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:59:13,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:59:13,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:59:13,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:59:13,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:59:13,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:59:13,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:13,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:59:13,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:59:13,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:59:13,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:59:13,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:59:13,502 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:59:13,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:59:13,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:59:13,502 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 -> e6909fdbd47ee7cc9ac1cfcb139a86d0e022eb1f9eab8a625d6818fa3999b29d [2022-02-20 16:59:13,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:59:13,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:59:13,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:59:13,757 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:59:13,758 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:59:13,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-2.c [2022-02-20 16:59:13,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21715af52/085609d942d3484b9af54fee1c13694e/FLAGb2f99d83a [2022-02-20 16:59:14,170 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:59:14,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-2.c [2022-02-20 16:59:14,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21715af52/085609d942d3484b9af54fee1c13694e/FLAGb2f99d83a [2022-02-20 16:59:14,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21715af52/085609d942d3484b9af54fee1c13694e [2022-02-20 16:59:14,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:59:14,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:59:14,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:14,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:59:14,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:59:14,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4e0c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14, skipping insertion in model container [2022-02-20 16:59:14,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:59:14,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:59:14,794 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/loops/insertion_sort-2.c[328,341] [2022-02-20 16:59:14,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:14,816 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:59:14,825 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/loops/insertion_sort-2.c[328,341] [2022-02-20 16:59:14,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:14,846 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:59:14,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14 WrapperNode [2022-02-20 16:59:14,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:14,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:14,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:59:14,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:59:14,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,900 INFO L137 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2022-02-20 16:59:14,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:14,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:59:14,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:59:14,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:59:14,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:59:14,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:59:14,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:59:14,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:59:14,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (1/1) ... [2022-02-20 16:59:14,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:14,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:14,980 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 16:59:14,991 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 16:59:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:59:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:59:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:59:15,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:59:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:59:15,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:59:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:59:15,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:59:15,066 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:59:15,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:59:15,275 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:59:15,280 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:59:15,280 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:59:15,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:15 BoogieIcfgContainer [2022-02-20 16:59:15,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:59:15,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:59:15,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:59:15,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:59:15,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:59:14" (1/3) ... [2022-02-20 16:59:15,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204f37d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:15, skipping insertion in model container [2022-02-20 16:59:15,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:14" (2/3) ... [2022-02-20 16:59:15,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@204f37d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:15, skipping insertion in model container [2022-02-20 16:59:15,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:15" (3/3) ... [2022-02-20 16:59:15,296 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2022-02-20 16:59:15,304 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:59:15,305 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:59:15,345 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:59:15,361 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 16:59:15,361 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:59:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:59:15,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:15,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:15,384 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1991822609, now seen corresponding path program 1 times [2022-02-20 16:59:15,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:15,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873635104] [2022-02-20 16:59:15,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:15,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#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(19, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-02-20 16:59:15,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {25#true} is VALID [2022-02-20 16:59:15,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {25#true} is VALID [2022-02-20 16:59:15,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#true} main_~j~0#1 := 1; {25#true} is VALID [2022-02-20 16:59:15,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-02-20 16:59:15,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#false} main_~k~0#1 := 1; {26#false} is VALID [2022-02-20 16:59:15,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {26#false} is VALID [2022-02-20 16:59:15,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume 0 == __VERIFIER_assert_~cond#1; {26#false} is VALID [2022-02-20 16:59:15,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-02-20 16:59:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:15,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:15,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873635104] [2022-02-20 16:59:15,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873635104] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:15,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:15,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:59:15,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137059199] [2022-02-20 16:59:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:15,672 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:59:15,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:15,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:15,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:59:15,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:59:15,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:59:15,725 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:15,779 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-02-20 16:59:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:59:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:59:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 16:59:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2022-02-20 16:59:15,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2022-02-20 16:59:15,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:15,873 INFO L225 Difference]: With dead ends: 40 [2022-02-20 16:59:15,873 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:59:15,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:59:15,879 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:15,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:59:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:59:15,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:15,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,901 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,901 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:15,903 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-20 16:59:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-20 16:59:15,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:15,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:15,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:59:15,905 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 16:59:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:15,907 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-20 16:59:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-20 16:59:15,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:15,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:15,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:15,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-02-20 16:59:15,911 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2022-02-20 16:59:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:15,911 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-20 16:59:15,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-20 16:59:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:59:15,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:15,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:15,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:59:15,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:15,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2015834155, now seen corresponding path program 1 times [2022-02-20 16:59:15,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:15,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452967723] [2022-02-20 16:59:15,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:16,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#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(19, 2);call #Ultimate.allocInit(12, 3); {139#true} is VALID [2022-02-20 16:59:16,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {141#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:16,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {142#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} is VALID [2022-02-20 16:59:16,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {142#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} main_~j~0#1 := 1; {142#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} is VALID [2022-02-20 16:59:16,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {142#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {142#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} is VALID [2022-02-20 16:59:16,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} main_~k~0#1 := 1; {143#(and (<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:16,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#(and (<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {140#false} is VALID [2022-02-20 16:59:16,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {140#false} assume 0 == __VERIFIER_assert_~cond#1; {140#false} is VALID [2022-02-20 16:59:16,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-02-20 16:59:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:16,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:16,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452967723] [2022-02-20 16:59:16,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452967723] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:16,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:16,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:59:16,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325494230] [2022-02-20 16:59:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:16,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:59:16,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:16,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:16,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:59:16,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:16,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:59:16,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:59:16,099 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:16,243 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:59:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:59:16,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:59:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-20 16:59:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-02-20 16:59:16,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-02-20 16:59:16,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:16,302 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:59:16,302 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:59:16,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:59:16,304 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:16,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 60 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:59:16,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-20 16:59:16,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:16,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,308 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,309 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:16,310 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-20 16:59:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-20 16:59:16,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:16,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:16,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 16:59:16,312 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 16:59:16,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:16,313 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-20 16:59:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-20 16:59:16,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:16,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:16,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:16,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 16:59:16,315 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2022-02-20 16:59:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:16,316 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 16:59:16,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 16:59:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:59:16,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:16,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:16,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:59:16,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:16,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1565261075, now seen corresponding path program 1 times [2022-02-20 16:59:16,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:16,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193574595] [2022-02-20 16:59:16,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:16,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:16,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#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(19, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-02-20 16:59:16,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {264#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:16,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {265#(and (<= (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1| 1) (+ (* (div |ULTIMATE.start_main_~j~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:16,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {265#(and (<= (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1| 1) (+ (* (div |ULTIMATE.start_main_~j~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|)) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {266#(and (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (<= (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1|) (+ (* 4294967296 (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 1) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)))} is VALID [2022-02-20 16:59:16,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {266#(and (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (<= (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1|) (+ (* 4294967296 (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 1) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {267#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-02-20 16:59:16,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} main_~j~0#1 := 1; {267#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-02-20 16:59:16,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {267#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-02-20 16:59:16,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} main_~k~0#1 := 1; {268#(and (<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:16,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(and (<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {263#false} is VALID [2022-02-20 16:59:16,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} assume 0 == __VERIFIER_assert_~cond#1; {263#false} is VALID [2022-02-20 16:59:16,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 16:59:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:16,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:16,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193574595] [2022-02-20 16:59:16,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193574595] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:16,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655968030] [2022-02-20 16:59:16,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:16,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:16,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:16,547 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 16:59:16,552 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 16:59:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:16,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:59:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:16,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:17,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#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(19, 2);call #Ultimate.allocInit(12, 3); {262#true} is VALID [2022-02-20 16:59:17,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {262#true} is VALID [2022-02-20 16:59:17,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {262#true} is VALID [2022-02-20 16:59:17,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {262#true} is VALID [2022-02-20 16:59:17,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {262#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {262#true} is VALID [2022-02-20 16:59:17,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} main_~j~0#1 := 1; {287#(= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 16:59:17,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#(= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {267#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-02-20 16:59:17,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} main_~k~0#1 := 1; {268#(and (<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:17,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(and (<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {263#false} is VALID [2022-02-20 16:59:17,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} assume 0 == __VERIFIER_assert_~cond#1; {263#false} is VALID [2022-02-20 16:59:17,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 16:59:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:59:17,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:59:17,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655968030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:17,034 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:59:17,034 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-02-20 16:59:17,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897784748] [2022-02-20 16:59:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:17,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:17,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:17,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:17,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:59:17,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:17,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:59:17,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:59:17,060 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:17,207 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-20 16:59:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:59:17,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-02-20 16:59:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-02-20 16:59:17,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-02-20 16:59:17,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:17,253 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:59:17,253 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:59:17,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:59:17,257 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:17,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 61 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:59:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-02-20 16:59:17,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:17,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,265 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,268 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:17,275 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 16:59:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:59:17,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:17,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:17,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 16:59:17,276 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 16:59:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:17,280 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-02-20 16:59:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:59:17,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:17,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:17,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:17,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-02-20 16:59:17,282 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-02-20 16:59:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:17,282 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-20 16:59:17,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-20 16:59:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:59:17,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:17,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:17,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 16:59:17,491 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 16:59:17,492 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1929667994, now seen corresponding path program 1 times [2022-02-20 16:59:17,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:17,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472410991] [2022-02-20 16:59:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:17,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#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(19, 2);call #Ultimate.allocInit(12, 3); {427#true} is VALID [2022-02-20 16:59:17,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {429#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:17,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {429#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {430#(and (<= (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1| 1) (+ (* (div |ULTIMATE.start_main_~j~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|)) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:17,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {430#(and (<= (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1| 1) (+ (* (div |ULTIMATE.start_main_~j~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|)) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {431#(and (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (<= (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1|) (+ (* 4294967296 (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 1) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)))} is VALID [2022-02-20 16:59:17,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {431#(and (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (<= (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~j~0#1|) (+ (* 4294967296 (div (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) 1) 4294967296)) |ULTIMATE.start_main_~SIZE~0#1|)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {432#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-02-20 16:59:17,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} main_~j~0#1 := 1; {433#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ (* (div |ULTIMATE.start_main_~j~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)))} is VALID [2022-02-20 16:59:17,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ (* (div |ULTIMATE.start_main_~j~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {428#false} is VALID [2022-02-20 16:59:17,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#false} main_#t~short10#1 := main_~i~0#1 >= 0; {428#false} is VALID [2022-02-20 16:59:17,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {428#false} is VALID [2022-02-20 16:59:17,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {428#false} is VALID [2022-02-20 16:59:17,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {428#false} is VALID [2022-02-20 16:59:17,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {428#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {428#false} is VALID [2022-02-20 16:59:17,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {428#false} is VALID [2022-02-20 16:59:17,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#false} main_~k~0#1 := 1; {428#false} is VALID [2022-02-20 16:59:17,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {428#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {428#false} is VALID [2022-02-20 16:59:17,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#false} assume 0 == __VERIFIER_assert_~cond#1; {428#false} is VALID [2022-02-20 16:59:17,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-02-20 16:59:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:17,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:17,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472410991] [2022-02-20 16:59:17,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472410991] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:17,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502097034] [2022-02-20 16:59:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:17,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:17,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:17,694 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 16:59:17,723 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 16:59:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:17,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:59:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:17,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:18,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#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(19, 2);call #Ultimate.allocInit(12, 3); {427#true} is VALID [2022-02-20 16:59:18,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {429#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:18,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {429#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {429#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:18,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {429#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {446#(= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 16:59:18,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {446#(= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {432#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-02-20 16:59:18,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} main_~j~0#1 := 1; {433#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ (* (div |ULTIMATE.start_main_~j~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)))} is VALID [2022-02-20 16:59:18,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ (* (div |ULTIMATE.start_main_~j~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1)))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {428#false} is VALID [2022-02-20 16:59:18,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#false} main_#t~short10#1 := main_~i~0#1 >= 0; {428#false} is VALID [2022-02-20 16:59:18,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {428#false} is VALID [2022-02-20 16:59:18,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {428#false} is VALID [2022-02-20 16:59:18,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {428#false} is VALID [2022-02-20 16:59:18,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {428#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {428#false} is VALID [2022-02-20 16:59:18,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {428#false} is VALID [2022-02-20 16:59:18,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#false} main_~k~0#1 := 1; {428#false} is VALID [2022-02-20 16:59:18,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {428#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {428#false} is VALID [2022-02-20 16:59:18,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#false} assume 0 == __VERIFIER_assert_~cond#1; {428#false} is VALID [2022-02-20 16:59:18,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-02-20 16:59:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:18,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:27,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-02-20 16:59:27,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#false} assume 0 == __VERIFIER_assert_~cond#1; {428#false} is VALID [2022-02-20 16:59:27,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {428#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {428#false} is VALID [2022-02-20 16:59:27,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#false} main_~k~0#1 := 1; {428#false} is VALID [2022-02-20 16:59:27,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {428#false} is VALID [2022-02-20 16:59:27,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {428#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {428#false} is VALID [2022-02-20 16:59:27,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {428#false} is VALID [2022-02-20 16:59:27,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {428#false} is VALID [2022-02-20 16:59:27,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#false} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {428#false} is VALID [2022-02-20 16:59:27,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#false} main_#t~short10#1 := main_~i~0#1 >= 0; {428#false} is VALID [2022-02-20 16:59:27,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {516#(not (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {428#false} is VALID [2022-02-20 16:59:27,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} main_~j~0#1 := 1; {516#(not (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-20 16:59:27,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {523#(forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int)) (or (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295) 1) 4294967296)) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|) (<= (+ |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)) 0) (<= 0 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {432#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1) 4294967296))} is VALID [2022-02-20 16:59:27,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {527#(forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int)) (or (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|) (<= (+ |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)) 0) (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295) 1) 4294967296)) (<= 0 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {523#(forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int)) (or (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295) 1) 4294967296)) (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|) (<= (+ |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)) 0) (<= 0 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)))} is VALID [2022-02-20 16:59:27,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#(forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int)) (or (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|) (<= (+ |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)) 0) (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295) 1) 4294967296)) (<= 0 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {527#(forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int)) (or (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|) (<= (+ |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)) 0) (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295) 1) 4294967296)) (<= 0 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)))} is VALID [2022-02-20 16:59:27,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {527#(forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| Int)) (or (<= 4294967296 |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|) (<= (+ |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295 (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)) 0) (< (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296) (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75| 4294967295) 1) 4294967296)) (<= 0 |aux_div_aux_mod_ULTIMATE.start_main_~SIZE~0#1_48_75|)))} is VALID [2022-02-20 16:59:27,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#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(19, 2);call #Ultimate.allocInit(12, 3); {427#true} is VALID [2022-02-20 16:59:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:27,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502097034] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:27,860 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:27,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-02-20 16:59:27,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109115539] [2022-02-20 16:59:27,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:59:27,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:27,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:27,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:27,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:59:27,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:27,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:59:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=77, Unknown=1, NotChecked=0, Total=110 [2022-02-20 16:59:27,963 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:28,193 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 16:59:28,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:59:28,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:59:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-02-20 16:59:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-02-20 16:59:28,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-02-20 16:59:28,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:28,239 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:59:28,239 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:59:28,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=46, Invalid=109, Unknown=1, NotChecked=0, Total=156 [2022-02-20 16:59:28,240 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:28,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 66 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-02-20 16:59:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:59:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-20 16:59:28,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:28,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:28,246 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:28,246 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:28,250 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 16:59:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 16:59:28,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:28,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:28,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:59:28,251 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:59:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:28,253 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 16:59:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 16:59:28,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:28,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:28,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:28,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:59:28,255 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 17 [2022-02-20 16:59:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:28,255 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:59:28,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:59:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:59:28,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:28,257 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:28,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 16:59:28,463 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 16:59:28,464 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:28,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash 797223332, now seen corresponding path program 2 times [2022-02-20 16:59:28,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:28,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482842024] [2022-02-20 16:59:28,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:28,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:29,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {667#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(19, 2);call #Ultimate.allocInit(12, 3); {667#true} is VALID [2022-02-20 16:59:29,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {667#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {669#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:29,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {669#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:29,006 INFO L290 TraceCheckUtils]: 3: Hoare triple {669#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {670#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:29,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {670#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {670#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:29,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:29,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:29,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {670#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:29,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {672#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 16:59:29,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {672#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} main_#t~short10#1 := main_~i~0#1 >= 0; {673#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0)) (not |ULTIMATE.start_main_#t~short10#1|)))} is VALID [2022-02-20 16:59:29,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0)) (not |ULTIMATE.start_main_#t~short10#1|)))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {674#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) |ULTIMATE.start_main_#t~short10#1|) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} is VALID [2022-02-20 16:59:29,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) |ULTIMATE.start_main_#t~short10#1|) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {675#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} is VALID [2022-02-20 16:59:29,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {675#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {676#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 16:59:29,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {676#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 16:59:29,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 16:59:29,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_~k~0#1 := 1; {678#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:29,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {678#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {679#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:59:29,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {679#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {668#false} is VALID [2022-02-20 16:59:29,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-02-20 16:59:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:29,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:29,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482842024] [2022-02-20 16:59:29,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482842024] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:29,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962642246] [2022-02-20 16:59:29,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:59:29,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:29,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:29,020 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 16:59:29,030 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 16:59:29,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:59:29,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:59:29,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 16:59:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:29,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:29,125 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 15 treesize of output 11 [2022-02-20 16:59:29,181 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 15 treesize of output 11 [2022-02-20 16:59:29,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:59:29,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-02-20 16:59:29,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:59:29,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-02-20 16:59:30,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {667#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(19, 2);call #Ultimate.allocInit(12, 3); {667#true} is VALID [2022-02-20 16:59:30,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {667#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {669#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:30,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {669#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:30,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {669#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {692#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:30,042 INFO L290 TraceCheckUtils]: 4: Hoare triple {692#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:30,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:30,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:30,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {671#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {670#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:30,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {708#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:59:30,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {708#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~short10#1 := main_~i~0#1 >= 0; {712#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:59:30,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {712#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {716#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) |ULTIMATE.start_main_#t~short10#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:59:30,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) |ULTIMATE.start_main_#t~short10#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {720#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:59:30,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {720#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 16:59:30,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 16:59:30,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 16:59:30,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {677#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_~k~0#1 := 1; {678#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:30,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {678#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {736#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:59:30,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {736#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {668#false} is VALID [2022-02-20 16:59:30,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-02-20 16:59:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:30,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:30,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {668#false} assume !false; {668#false} is VALID [2022-02-20 16:59:30,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {736#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {668#false} is VALID [2022-02-20 16:59:30,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {749#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {736#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:59:30,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {753#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} main_~k~0#1 := 1; {749#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} is VALID [2022-02-20 16:59:30,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {753#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {753#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 16:59:30,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {753#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {753#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 16:59:30,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {763#(forall ((v_ArrVal_45 Int)) (or (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_45)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {753#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 16:59:30,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {767#(or |ULTIMATE.start_main_#t~short10#1| (forall ((v_ArrVal_45 Int)) (or (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_45)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {763#(forall ((v_ArrVal_45 Int)) (or (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_45)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 16:59:30,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {771#(or (forall ((v_ArrVal_45 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (< v_ArrVal_45 (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))))) (not |ULTIMATE.start_main_#t~short10#1|))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {767#(or |ULTIMATE.start_main_#t~short10#1| (forall ((v_ArrVal_45 Int)) (or (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_45)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 16:59:30,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(or (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_45 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (< v_ArrVal_45 (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))))))} main_#t~short10#1 := main_~i~0#1 >= 0; {771#(or (forall ((v_ArrVal_45 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (< v_ArrVal_45 (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))))) (not |ULTIMATE.start_main_#t~short10#1|))} is VALID [2022-02-20 16:59:30,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {779#(or (forall ((v_ArrVal_45 Int)) (or (< v_ArrVal_45 (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))) (not (<= 1 |ULTIMATE.start_main_~j~0#1|)))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {775#(or (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_45 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (< v_ArrVal_45 (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))))))} is VALID [2022-02-20 16:59:30,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {667#true} main_~j~0#1 := 1; {779#(or (forall ((v_ArrVal_45 Int)) (or (< v_ArrVal_45 (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_45) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_45) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))) (not (<= 1 |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 16:59:30,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {667#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {667#true} is VALID [2022-02-20 16:59:30,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {667#true} is VALID [2022-02-20 16:59:30,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {667#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {667#true} is VALID [2022-02-20 16:59:30,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {667#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {667#true} is VALID [2022-02-20 16:59:30,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {667#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {667#true} is VALID [2022-02-20 16:59:30,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {667#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {667#true} is VALID [2022-02-20 16:59:30,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {667#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(19, 2);call #Ultimate.allocInit(12, 3); {667#true} is VALID [2022-02-20 16:59:30,981 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 16:59:30,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962642246] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:30,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:59:30,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13, 13] total 26 [2022-02-20 16:59:30,982 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251051262] [2022-02-20 16:59:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:30,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:59:30,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:30,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:31,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:59:31,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:31,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:59:31,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2022-02-20 16:59:31,014 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:31,229 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-02-20 16:59:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:59:31,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:59:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-02-20 16:59:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2022-02-20 16:59:31,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 40 transitions. [2022-02-20 16:59:31,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:31,281 INFO L225 Difference]: With dead ends: 36 [2022-02-20 16:59:31,281 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:59:31,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-02-20 16:59:31,283 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:31,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 67 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-02-20 16:59:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:59:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-02-20 16:59:31,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:31,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,304 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,304 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:31,305 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-02-20 16:59:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-02-20 16:59:31,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:31,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:31,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:59:31,306 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:59:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:31,307 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-02-20 16:59:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-02-20 16:59:31,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:31,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:31,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:31,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-02-20 16:59:31,310 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 19 [2022-02-20 16:59:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:31,310 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-02-20 16:59:31,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 16:59:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:59:31,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:31,311 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:31,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 16:59:31,540 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 16:59:31,541 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:31,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1477281702, now seen corresponding path program 1 times [2022-02-20 16:59:31,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:31,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096351095] [2022-02-20 16:59:31,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:31,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {966#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(19, 2);call #Ultimate.allocInit(12, 3); {966#true} is VALID [2022-02-20 16:59:31,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {966#true} is VALID [2022-02-20 16:59:31,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {966#true} is VALID [2022-02-20 16:59:31,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {966#true} is VALID [2022-02-20 16:59:31,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {966#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {966#true} is VALID [2022-02-20 16:59:31,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {966#true} is VALID [2022-02-20 16:59:31,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {966#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {966#true} is VALID [2022-02-20 16:59:31,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {966#true} main_~j~0#1 := 1; {968#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-20 16:59:31,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {969#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 16:59:31,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {969#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~short10#1 := main_~i~0#1 >= 0; {970#(and |ULTIMATE.start_main_#t~short10#1| (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-20 16:59:31,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {970#(and |ULTIMATE.start_main_#t~short10#1| (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} assume !main_#t~short10#1; {967#false} is VALID [2022-02-20 16:59:31,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {967#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {967#false} is VALID [2022-02-20 16:59:31,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {967#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {967#false} is VALID [2022-02-20 16:59:31,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {967#false} is VALID [2022-02-20 16:59:31,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {967#false} is VALID [2022-02-20 16:59:31,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {967#false} main_~k~0#1 := 1; {967#false} is VALID [2022-02-20 16:59:31,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {967#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {967#false} is VALID [2022-02-20 16:59:31,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {967#false} assume 0 == __VERIFIER_assert_~cond#1; {967#false} is VALID [2022-02-20 16:59:31,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-02-20 16:59:31,617 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 16:59:31,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:31,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096351095] [2022-02-20 16:59:31,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096351095] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:31,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:31,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:59:31,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033732450] [2022-02-20 16:59:31,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:31,618 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:59:31,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:31,619 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:31,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:59:31,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:59:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:59:31,631 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:31,759 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-02-20 16:59:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:59:31,759 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:59:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:31,760 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:59:31,761 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:59:31,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 16:59:31,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:31,805 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:59:31,805 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 16:59:31,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:59:31,806 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:31,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 16:59:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-02-20 16:59:31,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:31,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,825 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,825 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:31,826 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-20 16:59:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-20 16:59:31,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:31,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:31,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 16:59:31,827 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 16:59:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:31,828 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-20 16:59:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-20 16:59:31,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:31,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:31,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:31,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-02-20 16:59:31,830 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 19 [2022-02-20 16:59:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:31,831 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-02-20 16:59:31,831 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-20 16:59:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:59:31,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:31,832 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:31,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:59:31,832 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1495294633, now seen corresponding path program 1 times [2022-02-20 16:59:31,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:31,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168512262] [2022-02-20 16:59:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:31,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:31,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#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(19, 2);call #Ultimate.allocInit(12, 3); {1173#true} is VALID [2022-02-20 16:59:31,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1173#true} is VALID [2022-02-20 16:59:31,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1173#true} is VALID [2022-02-20 16:59:31,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {1173#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1173#true} is VALID [2022-02-20 16:59:31,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {1173#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1173#true} is VALID [2022-02-20 16:59:31,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1173#true} is VALID [2022-02-20 16:59:31,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1173#true} is VALID [2022-02-20 16:59:31,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} main_~j~0#1 := 1; {1175#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-20 16:59:31,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {1176#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:31,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1176#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} main_#t~short10#1 := main_~i~0#1 >= 0; {1176#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:31,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {1176#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1176#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:31,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1176#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|))} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {1177#(and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-20 16:59:31,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1177#(and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} main_#t~short10#1 := main_~i~0#1 >= 0; {1178#(not |ULTIMATE.start_main_#t~short10#1|)} is VALID [2022-02-20 16:59:31,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(not |ULTIMATE.start_main_#t~short10#1|)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1174#false} is VALID [2022-02-20 16:59:31,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1174#false} is VALID [2022-02-20 16:59:31,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1174#false} is VALID [2022-02-20 16:59:31,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1174#false} is VALID [2022-02-20 16:59:31,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {1174#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1174#false} is VALID [2022-02-20 16:59:31,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#false} main_~k~0#1 := 1; {1174#false} is VALID [2022-02-20 16:59:31,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1174#false} is VALID [2022-02-20 16:59:31,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#false} assume 0 == __VERIFIER_assert_~cond#1; {1174#false} is VALID [2022-02-20 16:59:31,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-02-20 16:59:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:59:31,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:31,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168512262] [2022-02-20 16:59:31,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168512262] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:31,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401272531] [2022-02-20 16:59:31,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:31,956 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 16:59:31,959 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 16:59:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:32,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:59:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:32,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:32,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#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(19, 2);call #Ultimate.allocInit(12, 3); {1173#true} is VALID [2022-02-20 16:59:32,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1173#true} is VALID [2022-02-20 16:59:32,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1173#true} is VALID [2022-02-20 16:59:32,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {1173#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1173#true} is VALID [2022-02-20 16:59:32,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {1173#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1173#true} is VALID [2022-02-20 16:59:32,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1173#true} is VALID [2022-02-20 16:59:32,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1173#true} is VALID [2022-02-20 16:59:32,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} main_~j~0#1 := 1; {1203#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 16:59:32,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:32,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short10#1 := main_~i~0#1 >= 0; {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:32,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:32,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {1217#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)} is VALID [2022-02-20 16:59:32,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {1217#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)} main_#t~short10#1 := main_~i~0#1 >= 0; {1178#(not |ULTIMATE.start_main_#t~short10#1|)} is VALID [2022-02-20 16:59:32,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(not |ULTIMATE.start_main_#t~short10#1|)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1174#false} is VALID [2022-02-20 16:59:32,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1174#false} is VALID [2022-02-20 16:59:32,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1174#false} is VALID [2022-02-20 16:59:32,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1174#false} is VALID [2022-02-20 16:59:32,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {1174#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1174#false} is VALID [2022-02-20 16:59:32,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#false} main_~k~0#1 := 1; {1174#false} is VALID [2022-02-20 16:59:32,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1174#false} is VALID [2022-02-20 16:59:32,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#false} assume 0 == __VERIFIER_assert_~cond#1; {1174#false} is VALID [2022-02-20 16:59:32,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-02-20 16:59:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:59:32,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:32,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-02-20 16:59:32,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#false} assume 0 == __VERIFIER_assert_~cond#1; {1174#false} is VALID [2022-02-20 16:59:32,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1174#false} is VALID [2022-02-20 16:59:32,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#false} main_~k~0#1 := 1; {1174#false} is VALID [2022-02-20 16:59:32,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {1174#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1174#false} is VALID [2022-02-20 16:59:32,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1174#false} is VALID [2022-02-20 16:59:32,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1174#false} is VALID [2022-02-20 16:59:32,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1174#false} is VALID [2022-02-20 16:59:32,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(not |ULTIMATE.start_main_#t~short10#1|)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1174#false} is VALID [2022-02-20 16:59:32,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {1217#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)} main_#t~short10#1 := main_~i~0#1 >= 0; {1178#(not |ULTIMATE.start_main_#t~short10#1|)} is VALID [2022-02-20 16:59:32,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {1217#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)} is VALID [2022-02-20 16:59:32,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:32,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short10#1 := main_~i~0#1 >= 0; {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:32,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {1207#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:32,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} main_~j~0#1 := 1; {1203#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 16:59:32,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1173#true} is VALID [2022-02-20 16:59:32,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1173#true} is VALID [2022-02-20 16:59:32,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {1173#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1173#true} is VALID [2022-02-20 16:59:32,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {1173#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1173#true} is VALID [2022-02-20 16:59:32,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1173#true} is VALID [2022-02-20 16:59:32,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1173#true} is VALID [2022-02-20 16:59:32,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#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(19, 2);call #Ultimate.allocInit(12, 3); {1173#true} is VALID [2022-02-20 16:59:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:59:32,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401272531] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:32,188 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:32,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-02-20 16:59:32,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905254340] [2022-02-20 16:59:32,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:32,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 16:59:32,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:32,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:32,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:59:32,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:32,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:59:32,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:59:32,213 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:32,506 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-02-20 16:59:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:59:32,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 16:59:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-02-20 16:59:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-02-20 16:59:32,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 74 transitions. [2022-02-20 16:59:32,581 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 16:59:32,582 INFO L225 Difference]: With dead ends: 73 [2022-02-20 16:59:32,582 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 16:59:32,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:59:32,583 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:32,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 97 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:59:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 16:59:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2022-02-20 16:59:32,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:32,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,608 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,608 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:32,609 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-02-20 16:59:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-20 16:59:32,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:32,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:32,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2022-02-20 16:59:32,610 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 60 states. [2022-02-20 16:59:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:32,612 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-02-20 16:59:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-20 16:59:32,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:32,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:32,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:32,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-02-20 16:59:32,614 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 22 [2022-02-20 16:59:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:32,614 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-02-20 16:59:32,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-02-20 16:59:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:59:32,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:32,615 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 16:59:32,634 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 16:59:32,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:32,823 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash -815236263, now seen corresponding path program 1 times [2022-02-20 16:59:32,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:32,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976213268] [2022-02-20 16:59:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:33,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {1579#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(19, 2);call #Ultimate.allocInit(12, 3); {1579#true} is VALID [2022-02-20 16:59:33,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1581#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {1581#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1581#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {1581#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1582#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:33,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {1582#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1582#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:33,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {1582#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1583#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:33,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {1583#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1583#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:33,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {1583#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {1582#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:33,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {1582#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {1584#(and (or (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-20 16:59:33,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {1584#(and (or (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} main_#t~short10#1 := main_~i~0#1 >= 0; {1585#(or (not |ULTIMATE.start_main_#t~short10#1|) (and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 16:59:33,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#(or (not |ULTIMATE.start_main_#t~short10#1|) (and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1586#(and (or (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (not |ULTIMATE.start_main_#t~short10#1|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 16:59:33,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {1586#(and (or (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (not |ULTIMATE.start_main_#t~short10#1|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {1587#(and (not (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (< 0 (+ 5 (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 16:59:33,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {1587#(and (not (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (< 0 (+ 5 (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_#t~short10#1 := main_~i~0#1 >= 0; {1588#(and (not (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (or (and |ULTIMATE.start_main_#t~short10#1| (< 0 (+ 5 (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)))} is VALID [2022-02-20 16:59:33,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1588#(and (not (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (or (and |ULTIMATE.start_main_#t~short10#1| (< 0 (+ 5 (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)))} assume !main_#t~short10#1; {1589#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))} is VALID [2022-02-20 16:59:33,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {1589#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1589#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))} is VALID [2022-02-20 16:59:33,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {1589#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1590#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-20 16:59:33,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {1590#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1591#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 16:59:33,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {1591#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1591#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 16:59:33,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} main_~k~0#1 := 1; {1592#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:33,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {1592#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1593#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:59:33,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {1593#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {1580#false} is VALID [2022-02-20 16:59:33,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#false} assume !false; {1580#false} is VALID [2022-02-20 16:59:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:33,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:33,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976213268] [2022-02-20 16:59:33,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976213268] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:33,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105893952] [2022-02-20 16:59:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:33,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:33,380 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 16:59:33,382 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 16:59:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:33,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 16:59:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:33,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:33,848 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-02-20 16:59:33,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-02-20 16:59:34,636 INFO L356 Elim1Store]: treesize reduction 108, result has 10.0 percent of original size [2022-02-20 16:59:34,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 31 [2022-02-20 16:59:35,881 INFO L356 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2022-02-20 16:59:35,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 16 [2022-02-20 16:59:36,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {1579#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(19, 2);call #Ultimate.allocInit(12, 3); {1579#true} is VALID [2022-02-20 16:59:36,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1579#true} is VALID [2022-02-20 16:59:36,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1579#true} is VALID [2022-02-20 16:59:36,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {1579#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1579#true} is VALID [2022-02-20 16:59:36,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {1579#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1579#true} is VALID [2022-02-20 16:59:36,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1579#true} is VALID [2022-02-20 16:59:36,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {1579#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1579#true} is VALID [2022-02-20 16:59:36,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#true} main_~j~0#1 := 1; {1618#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 16:59:36,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {1618#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {1622#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:36,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short10#1 := main_~i~0#1 >= 0; {1626#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))))} is VALID [2022-02-20 16:59:36,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {1626#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1630#(and (or (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (not |ULTIMATE.start_main_#t~short10#1|)) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:59:36,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {1630#(and (or (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (not |ULTIMATE.start_main_#t~short10#1|)) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {1634#(exists ((|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= |v_ULTIMATE.start_main_~i~0#1_15| 0)))} is VALID [2022-02-20 16:59:36,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {1634#(exists ((|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= |v_ULTIMATE.start_main_~i~0#1_15| 0)))} main_#t~short10#1 := main_~i~0#1 >= 0; {1638#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= |v_ULTIMATE.start_main_~i~0#1_15| 0))) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))))} is VALID [2022-02-20 16:59:36,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {1638#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= |v_ULTIMATE.start_main_~i~0#1_15| 0))) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))))} assume !main_#t~short10#1; {1642#(and (< |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))))))} is VALID [2022-02-20 16:59:36,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1642#(and (< |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1642#(and (< |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))))))} is VALID [2022-02-20 16:59:36,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {1642#(and (< |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_15| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))))))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1649#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|)))} is VALID [2022-02-20 16:59:36,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {1649#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|)))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1649#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|)))} is VALID [2022-02-20 16:59:36,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {1649#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1649#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|)))} is VALID [2022-02-20 16:59:36,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {1649#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|)))} main_~k~0#1 := 1; {1659#(and (= |ULTIMATE.start_main_~k~0#1| 1) (exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|))))} is VALID [2022-02-20 16:59:36,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {1659#(and (= |ULTIMATE.start_main_~k~0#1| 1) (exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_15| Int)) (and (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4 (* |v_ULTIMATE.start_main_~i~0#1_15| 4)))) (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_15| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_15|))))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1663#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:59:36,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {1663#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1580#false} is VALID [2022-02-20 16:59:36,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#false} assume !false; {1580#false} is VALID [2022-02-20 16:59:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:59:36,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:37,342 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 69 treesize of output 61 [2022-02-20 16:59:37,459 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-02-20 16:59:37,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 383 treesize of output 347 [2022-02-20 16:59:39,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#false} assume !false; {1580#false} is VALID [2022-02-20 16:59:39,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {1663#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1580#false} is VALID [2022-02-20 16:59:39,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {1676#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1663#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:59:39,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {1680#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} main_~k~0#1 := 1; {1676#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} is VALID [2022-02-20 16:59:39,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {1680#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1680#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 16:59:39,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {1680#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1680#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 16:59:39,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {1690#(forall ((v_ArrVal_98 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|))))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1680#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 16:59:39,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {1690#(forall ((v_ArrVal_98 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1690#(forall ((v_ArrVal_98 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|))))} is VALID [2022-02-20 16:59:39,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {1697#(or (forall ((v_ArrVal_98 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|)))) |ULTIMATE.start_main_#t~short10#1|)} assume !main_#t~short10#1; {1690#(forall ((v_ArrVal_98 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|))))} is VALID [2022-02-20 16:59:39,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {1701#(or (forall ((v_ArrVal_98 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|)))) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~short10#1 := main_~i~0#1 >= 0; {1697#(or (forall ((v_ArrVal_98 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|)))) |ULTIMATE.start_main_#t~short10#1|)} is VALID [2022-02-20 16:59:39,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {1705#(or (forall ((|v_ULTIMATE.start_main_~i~0#1_16| Int) (v_ArrVal_98 Int) (v_ArrVal_95 Int)) (or (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (not (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) v_ArrVal_95)) (not (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_16| 1))) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_95) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_95) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))) (not |ULTIMATE.start_main_#t~short10#1|))} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {1701#(or (forall ((v_ArrVal_98 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|)))) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:59:39,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {1709#(or (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (not |ULTIMATE.start_main_#t~short10#1|))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {1705#(or (forall ((|v_ULTIMATE.start_main_~i~0#1_16| Int) (v_ArrVal_98 Int) (v_ArrVal_95 Int)) (or (not (<= v_ArrVal_98 |ULTIMATE.start_main_~key~0#1|)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (not (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) v_ArrVal_95)) (not (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_16| 1))) (<= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_95) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_95) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_98) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))) (not |ULTIMATE.start_main_#t~short10#1|))} is VALID [2022-02-20 16:59:39,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#true} main_#t~short10#1 := main_~i~0#1 >= 0; {1709#(or (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (not |ULTIMATE.start_main_#t~short10#1|))} is VALID [2022-02-20 16:59:39,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {1579#true} is VALID [2022-02-20 16:59:39,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#true} main_~j~0#1 := 1; {1579#true} is VALID [2022-02-20 16:59:39,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {1579#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1579#true} is VALID [2022-02-20 16:59:39,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1579#true} is VALID [2022-02-20 16:59:39,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {1579#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1579#true} is VALID [2022-02-20 16:59:39,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {1579#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1579#true} is VALID [2022-02-20 16:59:39,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {1579#true} is VALID [2022-02-20 16:59:39,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {1579#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {1579#true} is VALID [2022-02-20 16:59:39,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {1579#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(19, 2);call #Ultimate.allocInit(12, 3); {1579#true} is VALID [2022-02-20 16:59:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:59:39,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105893952] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:39,075 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:39,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 32 [2022-02-20 16:59:39,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754938497] [2022-02-20 16:59:39,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:39,077 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 16:59:39,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:39,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:39,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:39,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-20 16:59:39,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:39,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-20 16:59:39,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=849, Unknown=1, NotChecked=0, Total=992 [2022-02-20 16:59:39,164 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:56,061 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2022-02-20 16:59:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-20 16:59:56,061 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 16:59:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 138 transitions. [2022-02-20 16:59:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 138 transitions. [2022-02-20 16:59:56,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 138 transitions. [2022-02-20 16:59:56,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:56,254 INFO L225 Difference]: With dead ends: 127 [2022-02-20 16:59:56,254 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 16:59:56,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=383, Invalid=2922, Unknown=1, NotChecked=0, Total=3306 [2022-02-20 16:59:56,256 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 112 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:56,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 296 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 250 Invalid, 0 Unknown, 252 Unchecked, 0.4s Time] [2022-02-20 16:59:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 16:59:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 43. [2022-02-20 16:59:56,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:56,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:56,296 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:56,296 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:56,299 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-02-20 16:59:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-02-20 16:59:56,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:56,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:56,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 125 states. [2022-02-20 16:59:56,300 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 125 states. [2022-02-20 16:59:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:56,303 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-02-20 16:59:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-02-20 16:59:56,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:56,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:56,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:56,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-02-20 16:59:56,305 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 22 [2022-02-20 16:59:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:56,305 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-02-20 16:59:56,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-02-20 16:59:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:59:56,306 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:56,306 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] [2022-02-20 16:59:56,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 16:59:56,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:56,526 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:56,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:56,527 INFO L85 PathProgramCache]: Analyzing trace with hash 755836794, now seen corresponding path program 1 times [2022-02-20 16:59:56,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:56,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752427938] [2022-02-20 16:59:56,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:56,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:56,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {2275#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(19, 2);call #Ultimate.allocInit(12, 3); {2275#true} is VALID [2022-02-20 16:59:56,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {2275#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2277#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:56,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {2277#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2277#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:56,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {2277#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2278#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:56,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {2278#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2278#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:56,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {2278#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2279#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:56,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {2279#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 16:59:56,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_~j~0#1 := 1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 16:59:56,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 16:59:56,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_#t~short10#1 := main_~i~0#1 >= 0; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 16:59:56,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 16:59:56,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 16:59:56,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 16:59:56,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 16:59:56,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 16:59:56,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_~k~0#1 := 1; {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:56,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:56,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:56,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:56,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} main_#t~post12#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2282#(<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 16:59:56,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {2282#(<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2276#false} is VALID [2022-02-20 16:59:56,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {2276#false} assume 0 == __VERIFIER_assert_~cond#1; {2276#false} is VALID [2022-02-20 16:59:56,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {2276#false} assume !false; {2276#false} is VALID [2022-02-20 16:59:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:59:56,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:56,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752427938] [2022-02-20 16:59:56,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752427938] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:56,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652326979] [2022-02-20 16:59:56,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:56,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:56,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:56,676 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 16:59:56,677 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 16:59:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:56,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 16:59:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:56,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:03,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {2275#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(19, 2);call #Ultimate.allocInit(12, 3); {2275#true} is VALID [2022-02-20 17:00:03,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {2275#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2277#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 17:00:03,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {2277#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2277#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 17:00:03,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {2277#(= |ULTIMATE.start_main_~j~0#1| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2278#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:03,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {2278#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2278#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:03,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {2278#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2279#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 17:00:03,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {2279#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:03,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_~j~0#1 := 1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:03,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:03,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_#t~short10#1 := main_~i~0#1 >= 0; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:03,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:03,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:03,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:03,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:03,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:03,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_~k~0#1 := 1; {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 17:00:03,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 17:00:03,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 17:00:03,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 17:00:03,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {2281#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} main_#t~post12#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2343#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 2) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 17:00:03,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {2343#(and (<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296)) (= (+ (- 2) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2276#false} is VALID [2022-02-20 17:00:03,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {2276#false} assume 0 == __VERIFIER_assert_~cond#1; {2276#false} is VALID [2022-02-20 17:00:03,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {2276#false} assume !false; {2276#false} is VALID [2022-02-20 17:00:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:00:03,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:04,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {2276#false} assume !false; {2276#false} is VALID [2022-02-20 17:00:04,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {2276#false} assume 0 == __VERIFIER_assert_~cond#1; {2276#false} is VALID [2022-02-20 17:00:04,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {2282#(<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1|))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2276#false} is VALID [2022-02-20 17:00:04,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {2362#(<= (+ (* (div (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1| 1))} main_#t~post12#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2282#(<= (+ (* (div |ULTIMATE.start_main_~k~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1|))} is VALID [2022-02-20 17:00:04,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {2362#(<= (+ (* (div (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {2362#(<= (+ (* (div (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 17:00:04,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {2362#(<= (+ (* (div (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {2362#(<= (+ (* (div (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 17:00:04,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {2362#(<= (+ (* (div (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2362#(<= (+ (* (div (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 17:00:04,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_~k~0#1 := 1; {2362#(<= (+ (* (div (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) 4294967296) |ULTIMATE.start_main_~SIZE~0#1|) (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-20 17:00:04,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:04,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:04,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:04,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:04,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:04,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_#t~short10#1 := main_~i~0#1 >= 0; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:04,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:04,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} main_~j~0#1 := 1; {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:04,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {2402#(<= 0 (+ (div (+ (* (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) (- 4294967294)) 4294967296) 1))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2280#(<= 0 (div (+ (* (- 1) |ULTIMATE.start_main_~SIZE~0#1|) 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)) 4294967296))} is VALID [2022-02-20 17:00:04,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#(<= 0 (+ (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) (- 4294967294)) 4294967296) 1))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2402#(<= 0 (+ (div (+ (* (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-02-20 17:00:04,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {2406#(<= 0 (+ (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) (- 4294967294)) 4294967296) 1))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2406#(<= 0 (+ (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-02-20 17:00:04,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {2413#(<= 0 (+ (div (+ (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296)) (- 4294967294)) 4294967296) 1))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2406#(<= 0 (+ (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-02-20 17:00:04,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {2413#(<= 0 (+ (div (+ (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296)) (- 4294967294)) 4294967296) 1))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2413#(<= 0 (+ (div (+ (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-02-20 17:00:04,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {2275#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2413#(<= 0 (+ (div (+ (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-02-20 17:00:04,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {2275#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(19, 2);call #Ultimate.allocInit(12, 3); {2275#true} is VALID [2022-02-20 17:00:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:00:04,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652326979] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:04,362 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:00:04,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-02-20 17:00:04,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17451412] [2022-02-20 17:00:04,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:04,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 17:00:04,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:04,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:04,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:04,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:00:04,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:00:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:00:04,408 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:05,139 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-02-20 17:00:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:00:05,139 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 17:00:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-02-20 17:00:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-02-20 17:00:05,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-02-20 17:00:05,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:05,210 INFO L225 Difference]: With dead ends: 118 [2022-02-20 17:00:05,210 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 17:00:05,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:00:05,212 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:05,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 152 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:00:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 17:00:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2022-02-20 17:00:05,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:05,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:05,276 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:05,277 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:05,278 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-02-20 17:00:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-02-20 17:00:05,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:05,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:05,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 69 states. [2022-02-20 17:00:05,279 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 69 states. [2022-02-20 17:00:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:05,281 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-02-20 17:00:05,281 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-02-20 17:00:05,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:05,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:05,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:05,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-02-20 17:00:05,283 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 23 [2022-02-20 17:00:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:05,284 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-02-20 17:00:05,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-02-20 17:00:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 17:00:05,284 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:05,285 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:05,310 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 17:00:05,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:05,504 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:05,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:05,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1735350921, now seen corresponding path program 1 times [2022-02-20 17:00:05,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:05,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753647458] [2022-02-20 17:00:05,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:05,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:05,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {2794#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(19, 2);call #Ultimate.allocInit(12, 3); {2794#true} is VALID [2022-02-20 17:00:05,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {2794#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2794#true} is VALID [2022-02-20 17:00:05,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {2794#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2794#true} is VALID [2022-02-20 17:00:05,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {2794#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2794#true} is VALID [2022-02-20 17:00:05,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {2794#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2794#true} is VALID [2022-02-20 17:00:05,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {2794#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2794#true} is VALID [2022-02-20 17:00:05,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {2794#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2794#true} is VALID [2022-02-20 17:00:05,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {2794#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2794#true} is VALID [2022-02-20 17:00:05,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {2794#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2794#true} is VALID [2022-02-20 17:00:05,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {2794#true} main_~j~0#1 := 1; {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-20 17:00:05,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-20 17:00:05,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} main_#t~short10#1 := main_~i~0#1 >= 0; {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-20 17:00:05,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-20 17:00:05,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-20 17:00:05,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-20 17:00:05,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {2796#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2797#(<= 2 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {2797#(<= 2 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2798#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:00:05,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {2798#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~short10#1 := main_~i~0#1 >= 0; {2799#|ULTIMATE.start_main_#t~short10#1|} is VALID [2022-02-20 17:00:05,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {2799#|ULTIMATE.start_main_#t~short10#1|} assume !main_#t~short10#1; {2795#false} is VALID [2022-02-20 17:00:05,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {2795#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2795#false} is VALID [2022-02-20 17:00:05,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {2795#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2795#false} is VALID [2022-02-20 17:00:05,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {2795#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2795#false} is VALID [2022-02-20 17:00:05,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {2795#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2795#false} is VALID [2022-02-20 17:00:05,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {2795#false} main_~k~0#1 := 1; {2795#false} is VALID [2022-02-20 17:00:05,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {2795#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2795#false} is VALID [2022-02-20 17:00:05,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {2795#false} assume 0 == __VERIFIER_assert_~cond#1; {2795#false} is VALID [2022-02-20 17:00:05,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {2795#false} assume !false; {2795#false} is VALID [2022-02-20 17:00:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 17:00:05,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:05,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753647458] [2022-02-20 17:00:05,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753647458] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:05,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745170175] [2022-02-20 17:00:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:05,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:05,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:05,604 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 17:00:05,633 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 17:00:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:05,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:00:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:05,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:05,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {2794#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(19, 2);call #Ultimate.allocInit(12, 3); {2794#true} is VALID [2022-02-20 17:00:05,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {2794#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2794#true} is VALID [2022-02-20 17:00:05,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {2794#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2794#true} is VALID [2022-02-20 17:00:05,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {2794#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2794#true} is VALID [2022-02-20 17:00:05,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {2794#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2794#true} is VALID [2022-02-20 17:00:05,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {2794#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2794#true} is VALID [2022-02-20 17:00:05,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {2794#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2794#true} is VALID [2022-02-20 17:00:05,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {2794#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2794#true} is VALID [2022-02-20 17:00:05,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {2794#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2794#true} is VALID [2022-02-20 17:00:05,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {2794#true} main_~j~0#1 := 1; {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} main_#t~short10#1 := main_~i~0#1 >= 0; {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2797#(<= 2 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {2797#(<= 2 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2798#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:00:05,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {2798#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~short10#1 := main_~i~0#1 >= 0; {2799#|ULTIMATE.start_main_#t~short10#1|} is VALID [2022-02-20 17:00:05,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {2799#|ULTIMATE.start_main_#t~short10#1|} assume !main_#t~short10#1; {2795#false} is VALID [2022-02-20 17:00:05,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {2795#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2795#false} is VALID [2022-02-20 17:00:05,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {2795#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2795#false} is VALID [2022-02-20 17:00:05,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {2795#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2795#false} is VALID [2022-02-20 17:00:05,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {2795#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2795#false} is VALID [2022-02-20 17:00:05,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {2795#false} main_~k~0#1 := 1; {2795#false} is VALID [2022-02-20 17:00:05,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {2795#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2795#false} is VALID [2022-02-20 17:00:05,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {2795#false} assume 0 == __VERIFIER_assert_~cond#1; {2795#false} is VALID [2022-02-20 17:00:05,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {2795#false} assume !false; {2795#false} is VALID [2022-02-20 17:00:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 17:00:05,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:05,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {2795#false} assume !false; {2795#false} is VALID [2022-02-20 17:00:05,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {2795#false} assume 0 == __VERIFIER_assert_~cond#1; {2795#false} is VALID [2022-02-20 17:00:05,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {2795#false} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2795#false} is VALID [2022-02-20 17:00:05,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {2795#false} main_~k~0#1 := 1; {2795#false} is VALID [2022-02-20 17:00:05,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {2795#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2795#false} is VALID [2022-02-20 17:00:05,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {2795#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2795#false} is VALID [2022-02-20 17:00:05,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {2795#false} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2795#false} is VALID [2022-02-20 17:00:05,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {2795#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2795#false} is VALID [2022-02-20 17:00:05,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {2799#|ULTIMATE.start_main_#t~short10#1|} assume !main_#t~short10#1; {2795#false} is VALID [2022-02-20 17:00:05,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {2909#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~short10#1 := main_~i~0#1 >= 0; {2799#|ULTIMATE.start_main_#t~short10#1|} is VALID [2022-02-20 17:00:05,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2909#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:00:05,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2830#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} main_#t~short10#1 := main_~i~0#1 >= 0; {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {2794#true} main_~j~0#1 := 1; {2916#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:00:05,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {2794#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2794#true} is VALID [2022-02-20 17:00:05,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {2794#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2794#true} is VALID [2022-02-20 17:00:05,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {2794#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2794#true} is VALID [2022-02-20 17:00:05,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {2794#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2794#true} is VALID [2022-02-20 17:00:05,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {2794#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2794#true} is VALID [2022-02-20 17:00:05,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {2794#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2794#true} is VALID [2022-02-20 17:00:05,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {2794#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {2794#true} is VALID [2022-02-20 17:00:05,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {2794#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {2794#true} is VALID [2022-02-20 17:00:05,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {2794#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(19, 2);call #Ultimate.allocInit(12, 3); {2794#true} is VALID [2022-02-20 17:00:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 17:00:05,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745170175] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:05,896 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:00:05,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-02-20 17:00:05,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723364622] [2022-02-20 17:00:05,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:00:05,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:05,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:05,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:05,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:00:05,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:05,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:00:05,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:00:05,928 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:06,406 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2022-02-20 17:00:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:00:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 17:00:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 86 transitions. [2022-02-20 17:00:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 86 transitions. [2022-02-20 17:00:06,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 86 transitions. [2022-02-20 17:00:06,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:06,473 INFO L225 Difference]: With dead ends: 101 [2022-02-20 17:00:06,473 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 17:00:06,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:00:06,474 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 91 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:06,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 68 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:00:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 17:00:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2022-02-20 17:00:06,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:06,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:06,536 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:06,537 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:06,538 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-02-20 17:00:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-02-20 17:00:06,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:06,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:06,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 17:00:06,539 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 17:00:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:06,540 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-02-20 17:00:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-02-20 17:00:06,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:06,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:06,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:06,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-02-20 17:00:06,542 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 27 [2022-02-20 17:00:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:06,542 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-02-20 17:00:06,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-02-20 17:00:06,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:00:06,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:06,543 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:06,569 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 17:00:06,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:06,760 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 17457638, now seen corresponding path program 2 times [2022-02-20 17:00:06,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:06,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858581460] [2022-02-20 17:00:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:07,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {3336#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(19, 2);call #Ultimate.allocInit(12, 3); {3336#true} is VALID [2022-02-20 17:00:07,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {3336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {3338#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 17:00:07,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {3338#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {3338#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 17:00:07,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {3338#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3339#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:07,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {3339#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {3339#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:07,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {3339#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:07,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:07,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:07,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:07,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {3339#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:07,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {3339#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {3341#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-20 17:00:07,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {3341#(and (or (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} main_#t~short10#1 := main_~i~0#1 >= 0; {3342#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not |ULTIMATE.start_main_#t~short10#1|)))} is VALID [2022-02-20 17:00:07,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {3342#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or (and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not |ULTIMATE.start_main_#t~short10#1|)))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {3343#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 17:00:07,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {3343#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {3343#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 17:00:07,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {3343#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {3339#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:07,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {3339#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3344#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 17:00:07,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {3344#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 17:00:07,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~short10#1 := main_~i~0#1 >= 0; {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 17:00:07,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 17:00:07,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {3346#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} is VALID [2022-02-20 17:00:07,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {3346#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} main_#t~short10#1 := main_~i~0#1 >= 0; {3347#(and (or (and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0)) (not |ULTIMATE.start_main_#t~short10#1|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:07,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {3347#(and (or (and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0)) (not |ULTIMATE.start_main_#t~short10#1|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {3348#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) |ULTIMATE.start_main_#t~short10#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} is VALID [2022-02-20 17:00:07,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {3348#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) |ULTIMATE.start_main_#t~short10#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {3349#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} is VALID [2022-02-20 17:00:07,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {3349#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 17:00:07,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 17:00:07,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 17:00:07,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_~k~0#1 := 1; {3351#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 17:00:07,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {3351#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3352#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:00:07,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {3352#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {3337#false} is VALID [2022-02-20 17:00:07,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {3337#false} assume !false; {3337#false} is VALID [2022-02-20 17:00:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:00:07,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:07,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858581460] [2022-02-20 17:00:07,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858581460] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:07,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646848182] [2022-02-20 17:00:07,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:00:07,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:07,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:07,300 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:00:07,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 17:00:07,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:00:07,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:00:07,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 17:00:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:07,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:07,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 17:00:07,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-02-20 17:00:08,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 17:00:08,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-02-20 17:00:08,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {3336#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(19, 2);call #Ultimate.allocInit(12, 3); {3336#true} is VALID [2022-02-20 17:00:08,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {3336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:08,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:08,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:08,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:08,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:08,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:08,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:08,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:08,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {3340#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:08,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:08,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} main_#t~short10#1 := main_~i~0#1 >= 0; {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:08,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:08,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:08,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:08,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {3383#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3344#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 17:00:08,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {3344#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 17:00:08,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~short10#1 := main_~i~0#1 >= 0; {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 17:00:08,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 17:00:08,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {3345#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {3346#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} is VALID [2022-02-20 17:00:08,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {3346#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} main_#t~short10#1 := main_~i~0#1 >= 0; {3417#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))) (or (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} is VALID [2022-02-20 17:00:08,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {3417#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))) (or (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0)))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {3348#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) |ULTIMATE.start_main_#t~short10#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} is VALID [2022-02-20 17:00:08,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {3348#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) |ULTIMATE.start_main_#t~short10#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {3349#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} is VALID [2022-02-20 17:00:08,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {3349#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) |ULTIMATE.start_main_~key~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 17:00:08,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 17:00:08,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 17:00:08,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {3350#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_~k~0#1 := 1; {3351#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 17:00:08,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {3351#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3439#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:00:08,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {3439#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3337#false} is VALID [2022-02-20 17:00:08,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {3337#false} assume !false; {3337#false} is VALID [2022-02-20 17:00:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 17:00:08,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:08,627 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 41 treesize of output 35 [2022-02-20 17:00:08,663 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-02-20 17:00:08,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 90 [2022-02-20 17:00:08,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {3337#false} assume !false; {3337#false} is VALID [2022-02-20 17:00:08,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {3439#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3337#false} is VALID [2022-02-20 17:00:08,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {3452#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3439#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:00:08,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {3456#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} main_~k~0#1 := 1; {3452#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)))} is VALID [2022-02-20 17:00:08,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {3456#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {3456#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 17:00:08,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {3456#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3456#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 17:00:08,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {3466#(forall ((v_ArrVal_167 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_167) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_167) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_167))))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {3456#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) |ULTIMATE.start_main_~#v~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))} is VALID [2022-02-20 17:00:08,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {3470#(or |ULTIMATE.start_main_#t~short10#1| (forall ((v_ArrVal_167 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_167) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_167) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_167)))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {3466#(forall ((v_ArrVal_167 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_167) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_167) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_167))))} is VALID [2022-02-20 17:00:08,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {3474#(or (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (not |ULTIMATE.start_main_#t~short10#1|))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {3470#(or |ULTIMATE.start_main_#t~short10#1| (forall ((v_ArrVal_167 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_167) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_167) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_167)))))} is VALID [2022-02-20 17:00:08,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {3478#(or (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (not (<= 0 |ULTIMATE.start_main_~i~0#1|)))} main_#t~short10#1 := main_~i~0#1 >= 0; {3474#(or (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (not |ULTIMATE.start_main_#t~short10#1|))} is VALID [2022-02-20 17:00:08,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {3482#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {3478#(or (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (not (<= 0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 17:00:08,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {3482#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {3482#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:08,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {3482#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~short10#1 := main_~i~0#1 >= 0; {3482#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:08,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {3492#(<= |ULTIMATE.start_main_~j~0#1| 2)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {3482#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:08,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3492#(<= |ULTIMATE.start_main_~j~0#1| 2)} is VALID [2022-02-20 17:00:08,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 17:00:08,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 17:00:08,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 17:00:08,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_#t~short10#1 := main_~i~0#1 >= 0; {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 17:00:08,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 17:00:08,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {3336#true} main_~j~0#1 := 1; {3496#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 17:00:08,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {3336#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {3336#true} is VALID [2022-02-20 17:00:08,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {3336#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3336#true} is VALID [2022-02-20 17:00:08,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {3336#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {3336#true} is VALID [2022-02-20 17:00:08,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {3336#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3336#true} is VALID [2022-02-20 17:00:08,949 INFO L290 TraceCheckUtils]: 4: Hoare triple {3336#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {3336#true} is VALID [2022-02-20 17:00:08,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {3336#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {3336#true} is VALID [2022-02-20 17:00:08,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {3336#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {3336#true} is VALID [2022-02-20 17:00:08,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {3336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {3336#true} is VALID [2022-02-20 17:00:08,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {3336#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(19, 2);call #Ultimate.allocInit(12, 3); {3336#true} is VALID [2022-02-20 17:00:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 17:00:08,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646848182] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:08,950 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:00:08,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 12] total 29 [2022-02-20 17:00:08,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714911286] [2022-02-20 17:00:08,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:08,951 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 17:00:08,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:08,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:09,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:09,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-20 17:00:09,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:09,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-20 17:00:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2022-02-20 17:00:09,018 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:11,002 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2022-02-20 17:00:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-20 17:00:11,003 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 17:00:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 111 transitions. [2022-02-20 17:00:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 111 transitions. [2022-02-20 17:00:11,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 111 transitions. [2022-02-20 17:00:11,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:11,105 INFO L225 Difference]: With dead ends: 120 [2022-02-20 17:00:11,105 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 17:00:11,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=586, Invalid=2276, Unknown=0, NotChecked=0, Total=2862 [2022-02-20 17:00:11,106 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 170 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:11,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 243 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 385 Invalid, 0 Unknown, 73 Unchecked, 0.5s Time] [2022-02-20 17:00:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 17:00:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 65. [2022-02-20 17:00:11,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:11,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:11,189 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:11,190 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:11,191 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-02-20 17:00:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-02-20 17:00:11,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:11,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:11,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 118 states. [2022-02-20 17:00:11,192 INFO L87 Difference]: Start difference. First operand has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 118 states. [2022-02-20 17:00:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:11,194 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-02-20 17:00:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-02-20 17:00:11,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:11,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:11,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:11,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-02-20 17:00:11,196 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 30 [2022-02-20 17:00:11,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:11,197 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-02-20 17:00:11,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-02-20 17:00:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:00:11,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:11,198 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:11,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:00:11,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 17:00:11,416 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1513919954, now seen corresponding path program 2 times [2022-02-20 17:00:11,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:11,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213606686] [2022-02-20 17:00:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:11,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:12,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {4076#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(19, 2);call #Ultimate.allocInit(12, 3); {4076#true} is VALID [2022-02-20 17:00:12,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {4076#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {4078#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 17:00:12,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {4078#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {4078#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 17:00:12,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {4078#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4079#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:12,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {4079#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {4079#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:12,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {4079#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4080#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 17:00:12,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {4080#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 17:00:12,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4081#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:12,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {4081#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {4081#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 17:00:12,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {4081#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {4079#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:12,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {4079#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {4082#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (= (* |ULTIMATE.start_main_~j~0#1| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-20 17:00:12,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {4082#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (= (* |ULTIMATE.start_main_~j~0#1| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} main_#t~short10#1 := main_~i~0#1 >= 0; {4082#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (= (* |ULTIMATE.start_main_~j~0#1| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-20 17:00:12,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (= (* |ULTIMATE.start_main_~j~0#1| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {4083#(and (or (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (not |ULTIMATE.start_main_#t~short10#1|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (= (* |ULTIMATE.start_main_~j~0#1| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-20 17:00:12,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {4083#(and (or (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (not |ULTIMATE.start_main_#t~short10#1|)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (= (* |ULTIMATE.start_main_~j~0#1| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {4084#(and (not (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (< 0 (+ 5 (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 17:00:12,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {4084#(and (not (= (+ |ULTIMATE.start_main_~#v~0#1.offset| 4) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (< 0 (+ 5 (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} main_#t~short10#1 := main_~i~0#1 >= 0; {4085#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or |ULTIMATE.start_main_#t~short10#1| (and (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))))} is VALID [2022-02-20 17:00:12,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {4085#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0) (or |ULTIMATE.start_main_#t~short10#1| (and (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))))} assume !main_#t~short10#1; {4086#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))} is VALID [2022-02-20 17:00:12,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {4086#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {4086#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))} is VALID [2022-02-20 17:00:12,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {4086#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~key~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {4087#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-20 17:00:12,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {4087#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4088#(and (= 8 (* |ULTIMATE.start_main_~j~0#1| 4)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} is VALID [2022-02-20 17:00:12,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {4088#(and (= 8 (* |ULTIMATE.start_main_~j~0#1| 4)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {4089#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (* |ULTIMATE.start_main_~i~0#1| 4) 4) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:12,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {4089#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (* |ULTIMATE.start_main_~i~0#1| 4) 4) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} main_#t~short10#1 := main_~i~0#1 >= 0; {4089#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (* |ULTIMATE.start_main_~i~0#1| 4) 4) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:12,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {4089#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (* |ULTIMATE.start_main_~i~0#1| 4) 4) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {4089#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (* |ULTIMATE.start_main_~i~0#1| 4) 4) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:12,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {4089#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (* |ULTIMATE.start_main_~i~0#1| 4) 4) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {4089#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (* |ULTIMATE.start_main_~i~0#1| 4) 4) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:12,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {4089#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (* |ULTIMATE.start_main_~i~0#1| 4) 4) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {4090#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:12,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {4090#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4090#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:12,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {4090#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {4090#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 17:00:12,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {4090#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) 0) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} main_~k~0#1 := 1; {4091#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 17:00:12,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {4091#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) (- 4) |ULTIMATE.start_main_~#v~0#1.offset|)) 1) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~k~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4092#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:00:12,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {4092#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {4077#false} is VALID [2022-02-20 17:00:12,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {4077#false} assume !false; {4077#false} is VALID [2022-02-20 17:00:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:12,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:12,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213606686] [2022-02-20 17:00:12,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213606686] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:12,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832751578] [2022-02-20 17:00:12,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:00:12,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:12,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:12,114 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:00:12,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 17:00:12,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:00:12,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:00:12,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 17:00:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:12,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:12,446 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-02-20 17:00:12,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2022-02-20 17:00:12,809 INFO L356 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-02-20 17:00:12,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 30 [2022-02-20 17:00:13,520 INFO L356 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2022-02-20 17:00:13,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-02-20 17:00:14,131 INFO L356 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2022-02-20 17:00:14,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2022-02-20 17:00:14,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {4076#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(19, 2);call #Ultimate.allocInit(12, 3); {4076#true} is VALID [2022-02-20 17:00:14,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {4076#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet6#1, main_#t~post5#1, main_#t~mem8#1, main_#t~mem11#1, main_#t~mem9#1, main_#t~short10#1, main_#t~post7#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~post12#1, main_~SIZE~0#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset;main_~SIZE~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~key~0#1;call main_~#v~0#1.base, main_~#v~0#1.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0#1 % 4294967296 % 4294967296 else main_~SIZE~0#1 % 4294967296 % 4294967296 - 4294967296));main_~j~0#1 := 0; {4076#true} is VALID [2022-02-20 17:00:14,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {4076#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {4076#true} is VALID [2022-02-20 17:00:14,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {4076#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4076#true} is VALID [2022-02-20 17:00:14,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {4076#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {4076#true} is VALID [2022-02-20 17:00:14,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {4076#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4076#true} is VALID [2022-02-20 17:00:14,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {4076#true} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;call write~int(main_#t~nondet6#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~nondet6#1; {4076#true} is VALID [2022-02-20 17:00:14,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {4076#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {4076#true} is VALID [2022-02-20 17:00:14,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {4076#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {4076#true} is VALID [2022-02-20 17:00:14,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {4076#true} main_~j~0#1 := 1; {4123#(= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 17:00:14,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {4123#(= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {4127#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 17:00:14,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {4127#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~j~0#1| 1))} main_#t~short10#1 := main_~i~0#1 >= 0; {4131#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 17:00:14,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {4131#(and (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_main_~j~0#1| 1))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {4135#(and (or (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (not |ULTIMATE.start_main_#t~short10#1|)) (= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:00:14,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {4135#(and (or (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (not |ULTIMATE.start_main_#t~short10#1|)) (= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~j~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !!main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1;call main_#t~mem11#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);call write~int(main_#t~mem11#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4);havoc main_#t~mem11#1;main_~i~0#1 := main_~i~0#1 - 1; {4139#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 17:00:14,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {4139#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~j~0#1| 1))} main_#t~short10#1 := main_~i~0#1 >= 0; {4143#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 17:00:14,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {4143#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (or (and |ULTIMATE.start_main_#t~short10#1| (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !main_#t~short10#1; {4147#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~i~0#1| 0) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 17:00:14,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {4147#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~i~0#1| 0) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {4147#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~i~0#1| 0) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 17:00:14,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {4147#(and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~i~0#1| 0) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (- 4) |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) (= |ULTIMATE.start_main_~j~0#1| 1))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {4154#(and (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~i~0#1| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 17:00:14,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {4154#(and (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= |ULTIMATE.start_main_~j~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) (< |ULTIMATE.start_main_~i~0#1| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))))) (= |ULTIMATE.start_main_~j~0#1| 1))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4158#(and (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))) (<= 2 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 17:00:14,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {4158#(and (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))) (<= 2 |ULTIMATE.start_main_~j~0#1|))} assume !!(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem8#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~j~0#1, 4);main_~key~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;main_~i~0#1 := main_~j~0#1 - 1; {4162#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 17:00:14,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {4162#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} main_#t~short10#1 := main_~i~0#1 >= 0; {4162#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 17:00:14,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {4162#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} assume main_#t~short10#1;call main_#t~mem9#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short10#1 := main_#t~mem9#1 > main_~key~0#1; {4162#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 17:00:14,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {4162#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {4162#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 17:00:14,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {4162#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {4175#(exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 17:00:14,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {4175#(exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4175#(exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 17:00:14,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {4175#(exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {4175#(exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 17:00:14,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {4175#(exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} main_~k~0#1 := 1; {4185#(and (= |ULTIMATE.start_main_~k~0#1| 1) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 17:00:14,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {4185#(and (= |ULTIMATE.start_main_~k~0#1| 1) (exists ((|v_ULTIMATE.start_main_~i~0#1_26| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_~i~0#1_26| 1)) (< |v_ULTIMATE.start_main_~i~0#1_26| 0) (< (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_26| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} assume !!(main_~k~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296);call main_#t~mem13#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (main_~k~0#1 - 1), 4);call main_#t~mem14#1 := read~int(main_~#v~0#1.base, main_~#v~0#1.offset + 4 * main_~k~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 <= main_#t~mem14#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4189#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:00:14,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {4189#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {4077#false} is VALID [2022-02-20 17:00:14,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {4077#false} assume !false; {4077#false} is VALID [2022-02-20 17:00:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 17:00:14,341 INFO L328 TraceCheckSpWp]: Computing backward predicates...