./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/insertion_sort-1.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-1.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 295b17c4ca5a4afcf4a0f36e9026f57ef5bd93d017747132380452b1ff4662bd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:59:12,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:59:12,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:59:12,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:59:12,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:59:12,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:59:12,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:59:12,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:59:12,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:59:12,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:59:12,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:59:12,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:59:12,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:59:12,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:59:12,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:59:12,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:59:12,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:59:12,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:59:12,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:59:12,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:59:12,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:59:12,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:59:12,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:59:12,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:59:12,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:59:12,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:59:12,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:59:12,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:59:12,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:59:12,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:59:12,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:59:12,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:59:12,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:59:12,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:59:12,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:59:12,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:59:12,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:59:12,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:59:12,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:59:12,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:59:12,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:59:12,623 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:12,646 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:59:12,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:59:12,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:59:12,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:59:12,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:59:12,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:59:12,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:59:12,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:59:12,651 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:59:12,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:59:12,652 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:59:12,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:59:12,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:59:12,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:59:12,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:59:12,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:59:12,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:59:12,653 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:59:12,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:59:12,654 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:59:12,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:59:12,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:59:12,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:59:12,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:59:12,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:12,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:59:12,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:59:12,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:59:12,655 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:59:12,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:59:12,656 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:59:12,656 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:59:12,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:59:12,656 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 -> 295b17c4ca5a4afcf4a0f36e9026f57ef5bd93d017747132380452b1ff4662bd [2022-02-20 16:59:12,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:59:12,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:59:12,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:59:12,890 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:59:12,891 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:59:12,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1.c [2022-02-20 16:59:12,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96103863c/92c63bf3ab4e4a45b343d09a859a16f5/FLAGa4ad7af77 [2022-02-20 16:59:13,275 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:59:13,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c [2022-02-20 16:59:13,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96103863c/92c63bf3ab4e4a45b343d09a859a16f5/FLAGa4ad7af77 [2022-02-20 16:59:13,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96103863c/92c63bf3ab4e4a45b343d09a859a16f5 [2022-02-20 16:59:13,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:59:13,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:59:13,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:13,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:59:13,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:59:13,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:13" (1/1) ... [2022-02-20 16:59:13,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cde09bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:13, skipping insertion in model container [2022-02-20 16:59:13,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:13" (1/1) ... [2022-02-20 16:59:13,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:59:13,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:59:13,848 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-1.c[328,341] [2022-02-20 16:59:13,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:13,869 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:59:13,877 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-1.c[328,341] [2022-02-20 16:59:13,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:13,891 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:59:13,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:13 WrapperNode [2022-02-20 16:59:13,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:13,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:13,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:59:13,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:59:13,898 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:13" (1/1) ... [2022-02-20 16:59:13,902 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:13" (1/1) ... [2022-02-20 16:59:13,924 INFO L137 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2022-02-20 16:59:13,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:13,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:59:13,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:59:13,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:59:13,930 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:13" (1/1) ... [2022-02-20 16:59:13,930 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:13" (1/1) ... [2022-02-20 16:59:13,932 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:13" (1/1) ... [2022-02-20 16:59:13,932 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:13" (1/1) ... [2022-02-20 16:59:13,936 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:13" (1/1) ... [2022-02-20 16:59:13,939 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:13" (1/1) ... [2022-02-20 16:59:13,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:13" (1/1) ... [2022-02-20 16:59:13,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:59:13,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:59:13,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:59:13,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:59:13,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:13" (1/1) ... [2022-02-20 16:59:13,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:13,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:13,972 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:13,973 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:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:59:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:59:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:59:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:59:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:59:13,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:59:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:59:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:59:14,049 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:59:14,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:59:14,268 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:59:14,275 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:59:14,277 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:59:14,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:14 BoogieIcfgContainer [2022-02-20 16:59:14,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:59:14,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:59:14,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:59:14,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:59:14,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:59:13" (1/3) ... [2022-02-20 16:59:14,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d68be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:14, skipping insertion in model container [2022-02-20 16:59:14,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:13" (2/3) ... [2022-02-20 16:59:14,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d68be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:14, skipping insertion in model container [2022-02-20 16:59:14,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:14" (3/3) ... [2022-02-20 16:59:14,311 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2022-02-20 16:59:14,315 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:59:14,315 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:59:14,357 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:59:14,374 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:14,374 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:59:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:59:14,391 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:14,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:14,393 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2015618667, now seen corresponding path program 1 times [2022-02-20 16:59:14,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:14,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652235841] [2022-02-20 16:59:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:14,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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); {27#true} is VALID [2022-02-20 16:59:14,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#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; {29#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:14,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(= |ULTIMATE.start_main_~j~0#1| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {30#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} is VALID [2022-02-20 16:59:14,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} main_~j~0#1 := 1; {30#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} is VALID [2022-02-20 16:59:14,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#(<= |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); {30#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} is VALID [2022-02-20 16:59:14,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#(<= |ULTIMATE.start_main_~SIZE~0#1| (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))} main_~k~0#1 := 1; {31#(and (<= |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:14,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#(and (<= |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; {28#false} is VALID [2022-02-20 16:59:14,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume 0 == __VERIFIER_assert_~cond#1; {28#false} is VALID [2022-02-20 16:59:14,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 16:59:14,721 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:14,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:14,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652235841] [2022-02-20 16:59:14,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652235841] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:14,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:14,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:59:14,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678424887] [2022-02-20 16:59:14,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:14,731 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:14,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:14,735 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:14,747 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:14,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:59:14,747 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:59:14,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:59:14,768 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:14,913 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2022-02-20 16:59:14,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:59:14,914 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:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:14,916 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:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 16:59:14,926 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:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-02-20 16:59:14,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2022-02-20 16:59:14,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:15,000 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:59:15,000 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:59:15,002 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:15,005 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:15,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 66 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:59:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-02-20 16:59:15,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:15,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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:15,028 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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:15,029 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:15,030 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:59:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:59:15,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:15,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:15,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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 22 states. [2022-02-20 16:59:15,032 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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 22 states. [2022-02-20 16:59:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:15,033 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:59:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:59:15,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:15,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:15,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:15,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-02-20 16:59:15,037 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 9 [2022-02-20 16:59:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:15,038 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-02-20 16:59:15,038 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:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-20 16:59:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:59:15,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:15,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:15,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:59:15,040 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:15,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1565476563, now seen corresponding path program 1 times [2022-02-20 16:59:15,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:15,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582998554] [2022-02-20 16:59:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:15,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:15,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#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); {176#true} is VALID [2022-02-20 16:59:15,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#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; {178#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:15,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {178#(= |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; {178#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:15,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {178#(= |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; {179#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:15,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {179#(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); {180#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1))} is VALID [2022-02-20 16:59:15,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1))} main_~j~0#1 := 1; {180#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1))} is VALID [2022-02-20 16:59:15,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#(<= |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); {180#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1))} is VALID [2022-02-20 16:59:15,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {180#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1))} main_~k~0#1 := 1; {181#(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:15,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {181#(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; {177#false} is VALID [2022-02-20 16:59:15,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#false} assume 0 == __VERIFIER_assert_~cond#1; {177#false} is VALID [2022-02-20 16:59:15,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-02-20 16:59:15,171 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:15,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:15,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582998554] [2022-02-20 16:59:15,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582998554] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:15,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814999314] [2022-02-20 16:59:15,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:15,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:15,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:15,174 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:15,175 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:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:15,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:59:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:15,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:15,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#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); {176#true} is VALID [2022-02-20 16:59:15,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#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; {176#true} is VALID [2022-02-20 16:59:15,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#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; {176#true} is VALID [2022-02-20 16:59:15,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {176#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {176#true} is VALID [2022-02-20 16:59:15,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {176#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {176#true} is VALID [2022-02-20 16:59:15,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} main_~j~0#1 := 1; {179#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:15,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {179#(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); {180#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1))} is VALID [2022-02-20 16:59:15,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {180#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296) 1))} main_~k~0#1 := 1; {181#(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:15,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {181#(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; {177#false} is VALID [2022-02-20 16:59:15,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#false} assume 0 == __VERIFIER_assert_~cond#1; {177#false} is VALID [2022-02-20 16:59:15,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-02-20 16:59:15,635 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:15,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:59:15,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814999314] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:15,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:59:15,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-02-20 16:59:15,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337318105] [2022-02-20 16:59:15,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:15,640 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:15,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:15,640 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:15,649 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:15,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:59:15,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:59:15,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:59:15,651 INFO L87 Difference]: Start difference. First operand 21 states and 26 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:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:15,777 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:59:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:59:15,778 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:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:15,778 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:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 16:59:15,780 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:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 16:59:15,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 16:59:15,813 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:15,814 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:59:15,814 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:59:15,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:59:15,816 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 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:15,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 73 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:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:59:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2022-02-20 16:59:15,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:15,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,821 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,822 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:15,823 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 16:59:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 16:59:15,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:15,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:15,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:59:15,825 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:59:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:15,826 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 16:59:15,827 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-02-20 16:59:15,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:15,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:15,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:15,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-20 16:59:15,829 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 11 [2022-02-20 16:59:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:15,830 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-20 16:59:15,830 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:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:59:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:59:15,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:15,831 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:15,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:59:16,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:16,046 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash 188510022, now seen corresponding path program 1 times [2022-02-20 16:59:16,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:16,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176055887] [2022-02-20 16:59:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:16,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#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); {353#true} is VALID [2022-02-20 16:59:16,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#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; {355#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:16,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#(= |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; {355#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:16,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {355#(= |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; {356#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:16,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {356#(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); {357#(<= 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,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#(<= 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; {358#(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:16,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {358#(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; {354#false} is VALID [2022-02-20 16:59:16,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {354#false} main_#t~short10#1 := main_~i~0#1 >= 0; {354#false} is VALID [2022-02-20 16:59:16,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {354#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; {354#false} is VALID [2022-02-20 16:59:16,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {354#false} is VALID [2022-02-20 16:59:16,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#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); {354#false} is VALID [2022-02-20 16:59:16,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {354#false} is VALID [2022-02-20 16:59:16,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {354#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {354#false} is VALID [2022-02-20 16:59:16,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {354#false} main_~k~0#1 := 1; {354#false} is VALID [2022-02-20 16:59:16,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {354#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; {354#false} is VALID [2022-02-20 16:59:16,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {354#false} assume 0 == __VERIFIER_assert_~cond#1; {354#false} is VALID [2022-02-20 16:59:16,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#false} assume !false; {354#false} is VALID [2022-02-20 16:59:16,146 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:16,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:16,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176055887] [2022-02-20 16:59:16,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176055887] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:16,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925992679] [2022-02-20 16:59:16,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:16,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:16,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:16,148 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:16,171 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:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:16,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:59:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:16,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:16,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#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); {353#true} is VALID [2022-02-20 16:59:16,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#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; {355#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:16,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#(= |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; {355#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:16,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {355#(= |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; {356#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:16,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {356#(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); {357#(<= 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,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#(<= 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; {358#(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:16,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {358#(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; {354#false} is VALID [2022-02-20 16:59:16,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {354#false} main_#t~short10#1 := main_~i~0#1 >= 0; {354#false} is VALID [2022-02-20 16:59:16,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {354#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; {354#false} is VALID [2022-02-20 16:59:16,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {354#false} is VALID [2022-02-20 16:59:16,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#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); {354#false} is VALID [2022-02-20 16:59:16,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {354#false} is VALID [2022-02-20 16:59:16,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {354#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {354#false} is VALID [2022-02-20 16:59:16,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {354#false} main_~k~0#1 := 1; {354#false} is VALID [2022-02-20 16:59:16,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {354#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; {354#false} is VALID [2022-02-20 16:59:16,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {354#false} assume 0 == __VERIFIER_assert_~cond#1; {354#false} is VALID [2022-02-20 16:59:16,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#false} assume !false; {354#false} is VALID [2022-02-20 16:59:16,681 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:16,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:22,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#false} assume !false; {354#false} is VALID [2022-02-20 16:59:22,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {354#false} assume 0 == __VERIFIER_assert_~cond#1; {354#false} is VALID [2022-02-20 16:59:22,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {354#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; {354#false} is VALID [2022-02-20 16:59:22,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {354#false} main_~k~0#1 := 1; {354#false} is VALID [2022-02-20 16:59:22,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {354#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {354#false} is VALID [2022-02-20 16:59:22,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {354#false} is VALID [2022-02-20 16:59:22,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {354#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); {354#false} is VALID [2022-02-20 16:59:22,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {354#false} is VALID [2022-02-20 16:59:22,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {354#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; {354#false} is VALID [2022-02-20 16:59:22,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {354#false} main_#t~short10#1 := main_~i~0#1 >= 0; {354#false} is VALID [2022-02-20 16:59:22,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {440#(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; {354#false} is VALID [2022-02-20 16:59:22,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#(<= 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; {440#(not (< (mod |ULTIMATE.start_main_~j~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-20 16:59:22,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {447#(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); {357#(<= 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:22,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {451#(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; {447#(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:22,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {451#(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; {451#(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:22,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#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; {451#(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:22,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#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); {353#true} is VALID [2022-02-20 16:59:22,478 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:22,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925992679] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:22,479 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:22,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-02-20 16:59:22,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208547501] [2022-02-20 16:59:22,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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) Word has length 17 [2022-02-20 16:59:22,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:22,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:22,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:22,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:59:22,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:22,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:59:22,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2022-02-20 16:59:22,525 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:22,685 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-02-20 16:59:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:59:22,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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) Word has length 17 [2022-02-20 16:59:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 16:59:22,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 16:59:22,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-02-20 16:59:22,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:22,728 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:59:22,728 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:59:22,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2022-02-20 16:59:22,729 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:22,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-02-20 16:59:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:59:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-02-20 16:59:22,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:22,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:22,737 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:22,737 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:22,738 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 16:59:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 16:59:22,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:22,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:22,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 16:59:22,739 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 16:59:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:22,740 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-20 16:59:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 16:59:22,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:22,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:22,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:22,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-20 16:59:22,742 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2022-02-20 16:59:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:22,743 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-20 16:59:22,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 16:59:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:59:22,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:22,744 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:22,760 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:22,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 16:59:22,960 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:22,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1379565948, now seen corresponding path program 2 times [2022-02-20 16:59:22,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:22,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536835912] [2022-02-20 16:59:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:23,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#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); {597#true} is VALID [2022-02-20 16:59:23,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#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; {599#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:23,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {599#(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; {599#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:23,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {599#(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; {600#(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:23,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {600#(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; {600#(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:23,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {600#(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; {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:23,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:23,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {600#(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:23,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {600#(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; {602#(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:23,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {602#(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; {603#(and (or (= (+ (* |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) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0))} is VALID [2022-02-20 16:59:23,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {603#(and (or (= (+ (* |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) (= (+ (- 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; {604#(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:23,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#(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; {605#(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:23,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {605#(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); {606#(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:23,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#(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; {607#(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:23,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {607#(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); {607#(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:23,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {607#(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; {608#(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:23,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {608#(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; {609#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:59:23,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {609#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {598#false} is VALID [2022-02-20 16:59:23,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-02-20 16:59:23,406 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:23,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:23,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536835912] [2022-02-20 16:59:23,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536835912] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:23,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34515061] [2022-02-20 16:59:23,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:59:23,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:23,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:23,409 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:23,411 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:23,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:59:23,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:59:23,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 16:59:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:23,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:23,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:59:23,842 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:24,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:59:24,075 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:24,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#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); {597#true} is VALID [2022-02-20 16:59:24,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#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; {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:24,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(= |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; {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:24,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {601#(= |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; {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:24,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {601#(= |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; {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:24,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(= |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; {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:24,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:24,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {634#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 16:59:24,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {634#(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; {638#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 16:59:24,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} main_#t~short10#1 := main_~i~0#1 >= 0; {642#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |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|))))} is VALID [2022-02-20 16:59:24,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (= |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|))))} 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; {646#(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:24,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {646#(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; {650#(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:24,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {650#(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); {607#(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:24,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {607#(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; {607#(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:24,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {607#(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); {607#(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:24,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {607#(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; {608#(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:24,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {608#(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; {666#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:59:24,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {666#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {598#false} is VALID [2022-02-20 16:59:24,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-02-20 16:59:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:59:24,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:24,607 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 16:59:24,636 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-02-20 16:59:24,636 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 16:59:24,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-02-20 16:59:24,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {666#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {598#false} is VALID [2022-02-20 16:59:24,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {679#(<= (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; {666#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:59:24,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {683#(<= (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; {679#(<= (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:24,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {683#(<= (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); {683#(<= (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:24,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {683#(<= (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; {683#(<= (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:24,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {693#(forall ((v_ArrVal_39 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_39) |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_39) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_39))))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {683#(<= (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:24,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {697#(or (forall ((v_ArrVal_39 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_39) |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_39) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_39)))) |ULTIMATE.start_main_#t~short10#1|)} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {693#(forall ((v_ArrVal_39 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_39) |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_39) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_39))))} is VALID [2022-02-20 16:59:24,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {701#(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; {697#(or (forall ((v_ArrVal_39 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_39) |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_39) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_39)))) |ULTIMATE.start_main_#t~short10#1|)} is VALID [2022-02-20 16:59:24,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {705#(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; {701#(or (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (not |ULTIMATE.start_main_#t~short10#1|))} is VALID [2022-02-20 16:59:24,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#(<= |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; {705#(or (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (not (<= 0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 16:59:24,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#true} main_~j~0#1 := 1; {709#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 16:59:24,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {597#true} is VALID [2022-02-20 16:59:24,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {597#true} is VALID [2022-02-20 16:59:24,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {597#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; {597#true} is VALID [2022-02-20 16:59:24,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {597#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {597#true} is VALID [2022-02-20 16:59:24,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#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; {597#true} is VALID [2022-02-20 16:59:24,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#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; {597#true} is VALID [2022-02-20 16:59:24,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#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); {597#true} is VALID [2022-02-20 16:59:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:59:24,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34515061] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:24,798 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:24,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 26 [2022-02-20 16:59:24,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875240392] [2022-02-20 16:59:24,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:24,799 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:59:24,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:24,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 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:24,833 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:24,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 16:59:24,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:24,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 16:59:24,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-02-20 16:59:24,835 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 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:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:25,704 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-02-20 16:59:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 16:59:25,704 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:59:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 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:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-02-20 16:59:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 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:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 99 transitions. [2022-02-20 16:59:25,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 99 transitions. [2022-02-20 16:59:25,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:25,788 INFO L225 Difference]: With dead ends: 80 [2022-02-20 16:59:25,789 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 16:59:25,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 16:59:25,790 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 96 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:25,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 169 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 274 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2022-02-20 16:59:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 16:59:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 36. [2022-02-20 16:59:25,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:25,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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:25,813 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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:25,813 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:25,819 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-02-20 16:59:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-02-20 16:59:25,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:25,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:25,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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 65 states. [2022-02-20 16:59:25,820 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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 65 states. [2022-02-20 16:59:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:25,825 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-02-20 16:59:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-02-20 16:59:25,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:25,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:25,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:25,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 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:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-02-20 16:59:25,828 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 19 [2022-02-20 16:59:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:25,828 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-02-20 16:59:25,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 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:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 16:59:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:59:25,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:25,829 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:25,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:59:26,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:26,045 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash -699507578, now seen corresponding path program 1 times [2022-02-20 16:59:26,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:26,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203035124] [2022-02-20 16:59:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:26,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {1038#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); {1038#true} is VALID [2022-02-20 16:59:26,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#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; {1038#true} is VALID [2022-02-20 16:59:26,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#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; {1038#true} is VALID [2022-02-20 16:59:26,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {1038#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1038#true} is VALID [2022-02-20 16:59:26,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {1038#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; {1038#true} is VALID [2022-02-20 16:59:26,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1038#true} is VALID [2022-02-20 16:59:26,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1038#true} is VALID [2022-02-20 16:59:26,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {1038#true} main_~j~0#1 := 1; {1040#(= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) 0)} is VALID [2022-02-20 16:59:26,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1040#(= (+ (- 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; {1041#(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:26,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {1041#(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; {1042#|ULTIMATE.start_main_#t~short10#1|} is VALID [2022-02-20 16:59:26,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#|ULTIMATE.start_main_#t~short10#1|} assume !main_#t~short10#1; {1039#false} is VALID [2022-02-20 16:59:26,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {1039#false} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1039#false} is VALID [2022-02-20 16:59:26,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {1039#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); {1039#false} is VALID [2022-02-20 16:59:26,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {1039#false} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1039#false} is VALID [2022-02-20 16:59:26,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {1039#false} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1039#false} is VALID [2022-02-20 16:59:26,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {1039#false} main_~k~0#1 := 1; {1039#false} is VALID [2022-02-20 16:59:26,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {1039#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; {1039#false} is VALID [2022-02-20 16:59:26,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {1039#false} assume 0 == __VERIFIER_assert_~cond#1; {1039#false} is VALID [2022-02-20 16:59:26,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {1039#false} assume !false; {1039#false} is VALID [2022-02-20 16:59:26,095 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:26,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:26,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203035124] [2022-02-20 16:59:26,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203035124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:26,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:26,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:59:26,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343442030] [2022-02-20 16:59:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:26,097 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:26,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:26,097 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:26,107 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:26,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:59:26,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:26,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:59:26,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:59:26,108 INFO L87 Difference]: Start difference. First operand 36 states and 45 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:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:26,220 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2022-02-20 16:59:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:59:26,221 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:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:26,221 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:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 16:59:26,222 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:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 16:59:26,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 16:59:26,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:26,263 INFO L225 Difference]: With dead ends: 72 [2022-02-20 16:59:26,263 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:59:26,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:59:26,264 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:26,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:59:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-02-20 16:59:26,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:26,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:26,287 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:26,287 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:26,288 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-02-20 16:59:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-02-20 16:59:26,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:26,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:26,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 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 45 states. [2022-02-20 16:59:26,289 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 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 45 states. [2022-02-20 16:59:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:26,290 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-02-20 16:59:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-02-20 16:59:26,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:26,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:26,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:26,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-02-20 16:59:26,292 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 19 [2022-02-20 16:59:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:26,292 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-02-20 16:59:26,292 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:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-02-20 16:59:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:59:26,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:26,293 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:26,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:59:26,293 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:26,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1125897754, now seen corresponding path program 1 times [2022-02-20 16:59:26,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:26,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605698222] [2022-02-20 16:59:26,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:26,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#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); {1278#true} is VALID [2022-02-20 16:59:26,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#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; {1280#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:26,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {1280#(= |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; {1280#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:26,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {1280#(= |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; {1281#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:26,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {1281#(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; {1281#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:26,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#(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; {1282#(and (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:26,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {1282#(and (not (<= (+ (div |ULTIMATE.start_main_~j~0#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_~j~0#1 := 1; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_#t~short10#1 := main_~i~0#1 >= 0; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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); {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_~k~0#1 := 1; {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:26,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (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; {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:26,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:26,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:26,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1285#(and (<= (div |ULTIMATE.start_main_~k~0#1| 4294967296) 0) (<= |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:26,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {1285#(and (<= (div |ULTIMATE.start_main_~k~0#1| 4294967296) 0) (<= |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; {1279#false} is VALID [2022-02-20 16:59:26,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {1279#false} assume 0 == __VERIFIER_assert_~cond#1; {1279#false} is VALID [2022-02-20 16:59:26,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {1279#false} assume !false; {1279#false} is VALID [2022-02-20 16:59:26,412 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:26,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:26,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605698222] [2022-02-20 16:59:26,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605698222] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:26,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424282768] [2022-02-20 16:59:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:26,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:26,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:26,419 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:26,421 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:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:26,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 16:59:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:26,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:26,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#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); {1278#true} is VALID [2022-02-20 16:59:26,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#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; {1280#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:26,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {1280#(= |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; {1280#(= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-20 16:59:26,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {1280#(= |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; {1281#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:26,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {1281#(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; {1281#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 1 |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:26,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {1281#(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; {1304#(and (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:26,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {1304#(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); {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_~j~0#1 := 1; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_#t~short10#1 := main_~i~0#1 >= 0; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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); {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:26,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_~k~0#1 := 1; {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:26,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (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; {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:26,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} assume !(0 == __VERIFIER_assert_~cond#1); {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:26,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:26,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {1284#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1347#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296))) (= (+ (- 2) |ULTIMATE.start_main_~k~0#1|) 0))} is VALID [2022-02-20 16:59:26,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {1347#(and (<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1279#false} is VALID [2022-02-20 16:59:26,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {1279#false} assume 0 == __VERIFIER_assert_~cond#1; {1279#false} is VALID [2022-02-20 16:59:26,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {1279#false} assume !false; {1279#false} is VALID [2022-02-20 16:59:26,900 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:26,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:27,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {1279#false} assume !false; {1279#false} is VALID [2022-02-20 16:59:27,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {1279#false} assume 0 == __VERIFIER_assert_~cond#1; {1279#false} is VALID [2022-02-20 16:59:27,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {1363#(not (< (mod |ULTIMATE.start_main_~k~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} 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; {1279#false} is VALID [2022-02-20 16:59:27,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#(not (< (mod (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} main_#t~post12#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1363#(not (< (mod |ULTIMATE.start_main_~k~0#1| 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-20 16:59:27,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#(not (< (mod (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1;havoc main_#t~mem14#1; {1367#(not (< (mod (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-20 16:59:27,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#(not (< (mod (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} assume !(0 == __VERIFIER_assert_~cond#1); {1367#(not (< (mod (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-20 16:59:27,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#(not (< (mod (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} 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; {1367#(not (< (mod (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-20 16:59:27,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_~k~0#1 := 1; {1367#(not (< (mod (+ |ULTIMATE.start_main_~k~0#1| 1) 4294967296) (mod |ULTIMATE.start_main_~SIZE~0#1| 4294967296)))} is VALID [2022-02-20 16:59:27,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:27,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_#t~post7#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:27,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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); {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:27,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:27,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:27,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_#t~short10#1 := main_~i~0#1 >= 0; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:27,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 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; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:27,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} main_~j~0#1 := 1; {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:27,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {1407#(<= 0 (div (+ (* (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) 2) 4294967296))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1283#(<= |ULTIMATE.start_main_~SIZE~0#1| (+ 2 (* (div |ULTIMATE.start_main_~SIZE~0#1| 4294967296) 4294967296)))} is VALID [2022-02-20 16:59:27,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {1411#(<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 2) 4294967296))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1407#(<= 0 (div (+ (* (- 1) (mod |ULTIMATE.start_main_~j~0#1| 4294967296)) 2) 4294967296))} is VALID [2022-02-20 16:59:27,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {1411#(<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 2) 4294967296))} 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; {1411#(<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 2) 4294967296))} is VALID [2022-02-20 16:59:27,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {1418#(<= 0 (div (+ 2 (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296))) 4294967296))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1411#(<= 0 (div (+ (* (- 1) (mod (+ |ULTIMATE.start_main_~j~0#1| 1) 4294967296)) 2) 4294967296))} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= 0 (div (+ 2 (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296))) 4294967296))} 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; {1418#(<= 0 (div (+ 2 (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296))) 4294967296))} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#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; {1418#(<= 0 (div (+ 2 (* (- 1) (mod (+ 2 |ULTIMATE.start_main_~j~0#1|) 4294967296))) 4294967296))} is VALID [2022-02-20 16:59:27,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#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); {1278#true} is VALID [2022-02-20 16:59:27,210 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:27,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424282768] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:27,210 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:27,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-20 16:59:27,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355236103] [2022-02-20 16:59:27,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:27,210 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 23 [2022-02-20 16:59:27,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:27,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 16:59:27,241 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:27,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 16:59:27,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 16:59:27,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-20 16:59:27,242 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 16:59:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:27,734 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2022-02-20 16:59:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:59:27,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 23 [2022-02-20 16:59:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 16:59:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-02-20 16:59:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 16:59:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-02-20 16:59:27,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-02-20 16:59:27,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:27,807 INFO L225 Difference]: With dead ends: 90 [2022-02-20 16:59:27,807 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 16:59:27,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-02-20 16:59:27,808 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 110 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:27,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 176 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:59:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 16:59:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-02-20 16:59:27,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:27,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 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,843 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 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,843 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 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,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:27,845 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-02-20 16:59:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-02-20 16:59:27,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:27,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:27,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 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 66 states. [2022-02-20 16:59:27,846 INFO L87 Difference]: Start difference. First operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 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 66 states. [2022-02-20 16:59:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:27,848 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-02-20 16:59:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-02-20 16:59:27,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:27,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:27,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:27,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 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,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-02-20 16:59:27,850 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 23 [2022-02-20 16:59:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:27,851 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-02-20 16:59:27,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 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 16:59:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-02-20 16:59:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:59:27,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:27,852 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:27,869 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:28,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:28,061 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:28,062 INFO L85 PathProgramCache]: Analyzing trace with hash -210329187, now seen corresponding path program 1 times [2022-02-20 16:59:28,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:28,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250085208] [2022-02-20 16:59:28,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:28,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:28,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {1758#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); {1758#true} is VALID [2022-02-20 16:59:28,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {1758#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; {1760#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:28,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {1760#(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; {1760#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:28,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {1760#(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; {1761#(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:28,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {1761#(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; {1761#(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:28,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {1761#(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; {1762#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:28,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {1762#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1762#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:28,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {1762#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {1761#(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:28,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {1761#(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; {1763#(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:28,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1763#(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; {1764#(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:28,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {1764#(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; {1765#(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:28,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {1765#(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; {1766#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (<= (+ |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|))) (= |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-20 16:59:28,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {1766#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (<= (+ |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|))) (= |ULTIMATE.start_main_~j~0#1| 1))} assume main_~i~0#1 < 2;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; {1767#(and (<= (+ |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| 4))) (= |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:28,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {1767#(and (<= (+ |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| 4))) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (= |ULTIMATE.start_main_~j~0#1| 1))} main_~i~0#1 := main_~i~0#1 - 1; {1768#(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:28,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {1768#(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; {1769#(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:28,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {1769#(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; {1770#(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:28,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {1770#(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; {1770#(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:28,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {1770#(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); {1771#(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:28,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {1771#(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; {1772#(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:28,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {1772#(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); {1772#(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:28,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {1772#(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; {1773#(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:28,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {1773#(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; {1774#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:59:28,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {1774#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {1759#false} is VALID [2022-02-20 16:59:28,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2022-02-20 16:59:28,532 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:28,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:28,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250085208] [2022-02-20 16:59:28,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250085208] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:28,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672345528] [2022-02-20 16:59:28,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:28,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:28,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:28,533 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:28,535 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:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:28,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 16:59:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:28,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:28,866 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-02-20 16:59:28,867 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:29,582 INFO L356 Elim1Store]: treesize reduction 108, result has 10.0 percent of original size [2022-02-20 16:59:29,583 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:30,833 INFO L356 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2022-02-20 16:59:30,833 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:31,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {1758#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); {1758#true} is VALID [2022-02-20 16:59:31,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1758#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; {1758#true} is VALID [2022-02-20 16:59:31,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1758#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; {1758#true} is VALID [2022-02-20 16:59:31,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {1758#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1758#true} is VALID [2022-02-20 16:59:31,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {1758#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; {1758#true} is VALID [2022-02-20 16:59:31,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1758#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1758#true} is VALID [2022-02-20 16:59:31,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {1758#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1758#true} is VALID [2022-02-20 16:59:31,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {1758#true} main_~j~0#1 := 1; {1799#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-20 16:59:31,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {1799#(<= |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; {1803#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:59:31,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {1803#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short10#1 := main_~i~0#1 >= 0; {1807#(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:31,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {1807#(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; {1811#(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:31,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {1811#(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; {1815#(and (< |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|))) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:59:31,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {1815#(and (< |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|))) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 < 2;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; {1819#(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|)) (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))) (< |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|))) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:59:31,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {1819#(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|)) (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))) (< |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|))) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_~i~0#1 := main_~i~0#1 - 1; {1823#(exists ((|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (<= |v_ULTIMATE.start_main_~i~0#1_16| 0) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 16:59:31,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {1823#(exists ((|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (<= |v_ULTIMATE.start_main_~i~0#1_16| 0) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} main_#t~short10#1 := main_~i~0#1 >= 0; {1827#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (<= |v_ULTIMATE.start_main_~i~0#1_16| 0) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 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|))))} is VALID [2022-02-20 16:59:31,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (<= |v_ULTIMATE.start_main_~i~0#1_16| 0) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 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|))))} assume !main_#t~short10#1; {1831#(and (< |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 16:59:31,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {1831#(and (< |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1831#(and (< |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 16:59:31,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {1831#(and (< |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< |ULTIMATE.start_main_~key~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 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); {1838#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 16:59:31,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {1838#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |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; {1838#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 16:59:31,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {1838#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1838#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 16:59:31,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {1838#(exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} main_~k~0#1 := 1; {1848#(and (= |ULTIMATE.start_main_~k~0#1| 1) (exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 16:59:31,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {1848#(and (= |ULTIMATE.start_main_~k~0#1| 1) (exists ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_16| Int)) (and (< |ULTIMATE.start_main_~i~0#1| 0) (<= |v_ULTIMATE.start_main_~i~0#1_16| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_16|) (< (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_16| 4) |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; {1852#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:59:31,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {1852#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1759#false} is VALID [2022-02-20 16:59:31,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2022-02-20 16:59:31,080 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:31,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:33,708 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:33,795 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-02-20 16:59:33,796 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:35,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {1759#false} assume !false; {1759#false} is VALID [2022-02-20 16:59:35,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {1852#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1759#false} is VALID [2022-02-20 16:59:35,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {1865#(<= (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; {1852#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:59:35,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {1869#(<= (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; {1865#(<= (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:35,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {1869#(<= (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); {1869#(<= (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:35,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {1869#(<= (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; {1869#(<= (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:35,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {1879#(forall ((v_ArrVal_88 Int)) (or (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= (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_88) |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_88) (+ |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); {1869#(<= (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:35,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {1879#(forall ((v_ArrVal_88 Int)) (or (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= (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_88) |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_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {1879#(forall ((v_ArrVal_88 Int)) (or (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= (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_88) |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_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 16:59:35,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {1886#(or |ULTIMATE.start_main_#t~short10#1| (forall ((v_ArrVal_88 Int)) (or (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= (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_88) |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_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} assume !main_#t~short10#1; {1879#(forall ((v_ArrVal_88 Int)) (or (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= (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_88) |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_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 16:59:35,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {1890#(or (<= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_88 Int)) (or (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= (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_88) |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_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} main_#t~short10#1 := main_~i~0#1 >= 0; {1886#(or |ULTIMATE.start_main_#t~short10#1| (forall ((v_ArrVal_88 Int)) (or (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= (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_88) |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_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 16:59:35,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {1894#(forall ((|v_ULTIMATE.start_main_~i~0#1_17| Int)) (or (not (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_17| 1))) (forall ((v_ArrVal_88 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_17|)))} main_~i~0#1 := main_~i~0#1 - 1; {1890#(or (<= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_88 Int)) (or (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= (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_88) |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_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is VALID [2022-02-20 16:59:35,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#(forall ((|v_ULTIMATE.start_main_~i~0#1_17| Int) (v_ArrVal_86 Int) (v_ArrVal_88 Int)) (or (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_86)) (not (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_17| 1))) (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_17|) (<= (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_86) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) |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_86) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} assume main_~i~0#1 < 2;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; {1894#(forall ((|v_ULTIMATE.start_main_~i~0#1_17| Int)) (or (not (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_17| 1))) (forall ((v_ArrVal_88 Int)) (or (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)))) (<= 0 |v_ULTIMATE.start_main_~i~0#1_17|)))} is VALID [2022-02-20 16:59:35,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {1902#(or (forall ((|v_ULTIMATE.start_main_~i~0#1_17| Int) (v_ArrVal_86 Int) (v_ArrVal_88 Int)) (or (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_86)) (not (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_17| 1))) (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_17|) (<= (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_86) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) |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_86) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) (+ |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; {1898#(forall ((|v_ULTIMATE.start_main_~i~0#1_17| Int) (v_ArrVal_86 Int) (v_ArrVal_88 Int)) (or (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_86)) (not (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_17| 1))) (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_17|) (<= (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_86) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) |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_86) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 16:59:35,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {1906#(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; {1902#(or (forall ((|v_ULTIMATE.start_main_~i~0#1_17| Int) (v_ArrVal_86 Int) (v_ArrVal_88 Int)) (or (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_86)) (not (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_17| 1))) (not (<= v_ArrVal_88 |ULTIMATE.start_main_~key~0#1|)) (<= 0 |v_ULTIMATE.start_main_~i~0#1_17|) (<= (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_86) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) |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_86) (+ (* |v_ULTIMATE.start_main_~i~0#1_17| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_88) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))) (not |ULTIMATE.start_main_#t~short10#1|))} is VALID [2022-02-20 16:59:35,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {1758#true} main_#t~short10#1 := main_~i~0#1 >= 0; {1906#(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:35,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {1758#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; {1758#true} is VALID [2022-02-20 16:59:35,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {1758#true} main_~j~0#1 := 1; {1758#true} is VALID [2022-02-20 16:59:35,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {1758#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {1758#true} is VALID [2022-02-20 16:59:35,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {1758#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1758#true} is VALID [2022-02-20 16:59:35,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {1758#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; {1758#true} is VALID [2022-02-20 16:59:35,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {1758#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1758#true} is VALID [2022-02-20 16:59:35,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {1758#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; {1758#true} is VALID [2022-02-20 16:59:35,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {1758#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; {1758#true} is VALID [2022-02-20 16:59:35,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {1758#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); {1758#true} is VALID [2022-02-20 16:59:35,827 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:35,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672345528] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:35,827 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:35,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 12] total 38 [2022-02-20 16:59:35,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620757569] [2022-02-20 16:59:35,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:35,828 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:59:35,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:35,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:36,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:36,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-20 16:59:36,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:36,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-20 16:59:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1205, Unknown=3, NotChecked=0, Total=1406 [2022-02-20 16:59:36,885 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:44,988 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2022-02-20 16:59:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-20 16:59:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:59:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 92 transitions. [2022-02-20 16:59:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 92 transitions. [2022-02-20 16:59:44,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 92 transitions. [2022-02-20 16:59:45,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:45,082 INFO L225 Difference]: With dead ends: 134 [2022-02-20 16:59:45,082 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 16:59:45,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=383, Invalid=2476, Unknown=3, NotChecked=0, Total=2862 [2022-02-20 16:59:45,084 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:45,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 308 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 299 Invalid, 0 Unknown, 224 Unchecked, 0.3s Time] [2022-02-20 16:59:45,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 16:59:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2022-02-20 16:59:45,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:45,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 78 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 77 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:45,146 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 78 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 77 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:45,146 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 78 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 77 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:45,148 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2022-02-20 16:59:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 148 transitions. [2022-02-20 16:59:45,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:45,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:45,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 77 states have internal predecessors, (98), 0 states have call successors, (0), 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 120 states. [2022-02-20 16:59:45,149 INFO L87 Difference]: Start difference. First operand has 78 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 77 states have internal predecessors, (98), 0 states have call successors, (0), 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 120 states. [2022-02-20 16:59:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:45,152 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2022-02-20 16:59:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 148 transitions. [2022-02-20 16:59:45,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:45,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:45,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:45,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 77 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2022-02-20 16:59:45,154 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 24 [2022-02-20 16:59:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:45,154 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2022-02-20 16:59:45,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2022-02-20 16:59:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 16:59:45,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:45,155 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:45,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:59:45,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:45,375 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:45,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1447473291, now seen corresponding path program 3 times [2022-02-20 16:59:45,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:45,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042052146] [2022-02-20 16:59:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:45,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {2486#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); {2486#true} is VALID [2022-02-20 16:59:45,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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; {2488#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:45,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {2488#(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; {2488#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:45,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {2488#(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; {2489#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:45,850 INFO L290 TraceCheckUtils]: 4: Hoare triple {2489#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 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; {2489#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:45,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {2489#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 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; {2490#(and (not (= (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)) 0)) (= |ULTIMATE.start_main_~#v~0#1.offset| 0))} is VALID [2022-02-20 16:59:45,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {2490#(and (not (= (+ |ULTIMATE.start_main_~#v~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)) 0)) (= |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; {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:45,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {2491#(= |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; {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:45,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:45,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {2489#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:45,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {2489#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 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; {2492#(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:45,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {2492#(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; {2493#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0) (and (<= (+ (* |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_~j~0#1| 1))} is VALID [2022-02-20 16:59:45,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {2493#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (or (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset|) 0) (and (<= (+ (* |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_~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; {2494#(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:45,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(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; {2495#(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:45,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {2495#(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); {2496#(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:45,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {2496#(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; {2497#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (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:45,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {2497#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (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);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; {2498#(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))) (not (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)) (= |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:45,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {2498#(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))) (not (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)) (= |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~short10#1 := main_~i~0#1 >= 0; {2498#(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))) (not (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)) (= |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:45,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {2498#(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))) (not (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)) (= |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_#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; {2498#(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))) (not (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)) (= |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:45,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {2498#(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))) (not (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)) (= |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_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2498#(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))) (not (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)) (= |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:45,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {2498#(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))) (not (= (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) 0)) (= |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))))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2499#(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:45,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {2499#(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; {2499#(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:45,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {2499#(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); {2499#(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:45,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {2499#(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; {2500#(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:45,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {2500#(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; {2501#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 16:59:45,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {2501#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {2487#false} is VALID [2022-02-20 16:59:45,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-02-20 16:59:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:45,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:45,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042052146] [2022-02-20 16:59:45,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042052146] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:45,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703306676] [2022-02-20 16:59:45,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 16:59:45,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:45,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:45,864 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:45,865 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:45,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 16:59:45,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:59:45,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 16:59:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:45,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:46,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:59:46,245 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 34 treesize of output 33 [2022-02-20 16:59:46,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:59:46,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:59:46,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:59:46,420 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:59:46,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-02-20 16:59:46,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:59:46,583 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:46,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {2486#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); {2486#true} is VALID [2022-02-20 16:59:46,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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; {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:46,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {2491#(= |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; {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:46,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {2491#(= |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; {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:46,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {2491#(= |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; {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:46,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {2491#(= |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; {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:46,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {2491#(= |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; {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:46,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {2491#(= |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; {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:46,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} is VALID [2022-02-20 16:59:46,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#(= |ULTIMATE.start_main_~#v~0#1.offset| 0)} main_~j~0#1 := 1; {2489#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:46,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {2489#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 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; {2535#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:46,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {2535#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 1) |ULTIMATE.start_main_~j~0#1|))} main_#t~short10#1 := main_~i~0#1 >= 0; {2539#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) |ULTIMATE.start_main_#t~short10#1| (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 1) |ULTIMATE.start_main_~j~0#1|))} is VALID [2022-02-20 16:59:46,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {2539#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) |ULTIMATE.start_main_#t~short10#1| (<= (+ (div (* (- 1) |ULTIMATE.start_main_~#v~0#1.offset|) 4) 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; {2494#(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:46,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(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; {2495#(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:46,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {2495#(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); {2496#(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:46,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {2496#(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; {2497#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (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:46,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {2497#(and (= |ULTIMATE.start_main_~#v~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= (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);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; {2555#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |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:46,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {2555#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |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~short10#1 := main_~i~0#1 >= 0; {2559#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) |ULTIMATE.start_main_#t~short10#1| (<= (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:46,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {2559#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~#v~0#1.offset| 0) |ULTIMATE.start_main_#t~short10#1| (<= (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_#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; {2555#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |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:46,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {2555#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |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_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2555#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |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:46,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {2555#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |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))))} call write~int(main_~key~0#1, main_~#v~0#1.base, main_~#v~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2499#(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:46,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {2499#(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; {2499#(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:46,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {2499#(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); {2499#(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:46,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {2499#(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; {2500#(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:46,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {2500#(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; {2581#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 16:59:46,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {2581#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2487#false} is VALID [2022-02-20 16:59:46,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-02-20 16:59:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 16:59:46,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:05,134 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 57 treesize of output 51 [2022-02-20 17:00:05,213 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-02-20 17:00:05,214 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 373 treesize of output 363 [2022-02-20 17:00:07,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2022-02-20 17:00:07,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {2581#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2487#false} is VALID [2022-02-20 17:00:07,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {2594#(<= (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; {2581#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:00:07,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {2598#(<= (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; {2594#(<= (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:07,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {2598#(<= (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); {2598#(<= (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:07,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#(<= (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; {2598#(<= (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:07,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {2608#(forall ((v_ArrVal_115 Int)) (<= (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_115) |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_115) (+ |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); {2598#(<= (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:07,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {2608#(forall ((v_ArrVal_115 Int)) (<= (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_115) |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_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2608#(forall ((v_ArrVal_115 Int)) (<= (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_115) |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_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 17:00:07,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {2615#(or (forall ((v_ArrVal_115 Int)) (<= (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_115) |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_115) (+ |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; {2608#(forall ((v_ArrVal_115 Int)) (<= (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_115) |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_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))} is VALID [2022-02-20 17:00:07,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {2619#(or (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_115 Int)) (<= (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_115) |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_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} main_#t~short10#1 := main_~i~0#1 >= 0; {2615#(or (forall ((v_ArrVal_115 Int)) (<= (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_115) |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_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))) (not |ULTIMATE.start_main_#t~short10#1|))} is VALID [2022-02-20 17:00:07,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {2623#(forall ((|v_ULTIMATE.start_main_~i~0#1_18| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_18|)) (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_18| 1))) (forall ((v_ArrVal_115 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 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; {2619#(or (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_115 Int)) (<= (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_115) |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_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4)))))} is VALID [2022-02-20 17:00:07,764 WARN L290 TraceCheckUtils]: 15: Hoare triple {2627#(forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_18| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_18|)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_18| |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; {2623#(forall ((|v_ULTIMATE.start_main_~i~0#1_18| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_18|)) (not (<= |ULTIMATE.start_main_~j~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_18| 1))) (forall ((v_ArrVal_115 Int)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))))))} is UNKNOWN [2022-02-20 17:00:08,562 WARN L290 TraceCheckUtils]: 14: Hoare triple {2631#(forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_18| Int) (v_ArrVal_113 Int)) (or (<= (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_113) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) |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_113) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_18|)) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_113)) (< |v_ULTIMATE.start_main_~i~0#1_18| |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); {2627#(forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_18| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_18|)) (<= (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) |ULTIMATE.start_main_~#v~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~#v~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_18| |ULTIMATE.start_main_~j~0#1|)))} is UNKNOWN [2022-02-20 17:00:08,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {2635#(or |ULTIMATE.start_main_#t~short10#1| (forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_18| Int) (v_ArrVal_113 Int)) (or (<= (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_113) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) |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_113) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_18|)) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_113)) (< |v_ULTIMATE.start_main_~i~0#1_18| |ULTIMATE.start_main_~j~0#1|))))} assume !main_#t~short10#1;havoc main_#t~mem9#1;havoc main_#t~short10#1; {2631#(forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_18| Int) (v_ArrVal_113 Int)) (or (<= (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_113) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) |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_113) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_18|)) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_113)) (< |v_ULTIMATE.start_main_~i~0#1_18| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:00:08,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {2639#(or (not |ULTIMATE.start_main_#t~short10#1|) (and (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (< 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; {2635#(or |ULTIMATE.start_main_#t~short10#1| (forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_18| Int) (v_ArrVal_113 Int)) (or (<= (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_113) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) |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_113) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115) (+ |ULTIMATE.start_main_~#v~0#1.offset| 4))) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_18|)) (not (<= |ULTIMATE.start_main_~key~0#1| v_ArrVal_113)) (< |v_ULTIMATE.start_main_~i~0#1_18| |ULTIMATE.start_main_~j~0#1|))))} is VALID [2022-02-20 17:00:08,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {2643#(or (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (< 0 |ULTIMATE.start_main_~j~0#1|)))} main_#t~short10#1 := main_~i~0#1 >= 0; {2639#(or (not |ULTIMATE.start_main_#t~short10#1|) (and (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (< 0 |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:00:08,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {2647#(or (= 4 (* |ULTIMATE.start_main_~j~0#1| 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; {2643#(or (not (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and (= (* |ULTIMATE.start_main_~i~0#1| 4) 0) (< 0 |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:00:08,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {2486#true} main_~j~0#1 := 1; {2647#(or (= 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (not (<= 1 |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-20 17:00:08,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {2486#true} assume !(main_~j~0#1 % 4294967296 < main_~SIZE~0#1 % 4294967296); {2486#true} is VALID [2022-02-20 17:00:08,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {2486#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2486#true} is VALID [2022-02-20 17:00:08,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {2486#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; {2486#true} is VALID [2022-02-20 17:00:08,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2486#true} is VALID [2022-02-20 17:00:08,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {2486#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; {2486#true} is VALID [2022-02-20 17:00:08,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {2486#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2486#true} is VALID [2022-02-20 17:00:08,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#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; {2486#true} is VALID [2022-02-20 17:00:08,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#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; {2486#true} is VALID [2022-02-20 17:00:08,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {2486#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); {2486#true} is VALID [2022-02-20 17:00:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 17:00:08,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703306676] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:08,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:00:08,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 33 [2022-02-20 17:00:08,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228233932] [2022-02-20 17:00:08,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:08,567 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 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:08,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:08,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:10,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 56 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:10,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-20 17:00:10,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:10,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-20 17:00:10,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=868, Unknown=18, NotChecked=0, Total=1056 [2022-02-20 17:00:10,802 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:12,765 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (and (= (* |c_ULTIMATE.start_main_~i~0#1| 4) 0) (< 0 |c_ULTIMATE.start_main_~j~0#1|)))) (and (or (forall ((v_ArrVal_115 Int) (|v_ULTIMATE.start_main_~i~0#1_18| Int) (v_ArrVal_113 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_18|)) (not (<= |c_ULTIMATE.start_main_~key~0#1| v_ArrVal_113)) (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_113) (+ (* |v_ULTIMATE.start_main_~i~0#1_18| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_115))) (<= (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_18| |c_ULTIMATE.start_main_~j~0#1|))) |c_ULTIMATE.start_main_#t~short10#1|) (not (= (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) 0)) (or (not (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) .cse1) (or (not |c_ULTIMATE.start_main_#t~short10#1|) .cse1) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0))) is different from false