/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:54,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:54,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:54,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:54,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:54,944 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:54,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:54,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:54,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:54,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:54,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:54,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:54,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:54,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:54,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:54,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:54,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:54,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:54,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:54,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:54,968 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:54,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:54,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:54,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:54,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:54,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:54,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:54,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:54,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:54,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:54,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:54,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:54,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:54,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:54,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:54,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:54,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:54,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:54,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:54,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:54,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:54,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:54,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:16:55,014 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:55,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:55,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:55,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:55,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:55,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:55,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:55,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:55,015 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:55,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:55,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:55,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:55,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:55,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:55,017 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:16:55,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:55,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:55,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:55,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:55,349 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:55,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-1.c [2022-04-27 10:16:55,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13c28ec4/f01b251468764e5bbe617e4841af9740/FLAGec69e3b92 [2022-04-27 10:16:55,814 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:55,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c [2022-04-27 10:16:55,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13c28ec4/f01b251468764e5bbe617e4841af9740/FLAGec69e3b92 [2022-04-27 10:16:55,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13c28ec4/f01b251468764e5bbe617e4841af9740 [2022-04-27 10:16:55,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:16:55,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:16:55,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:55,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:16:55,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:16:55,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f7e9642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:55, skipping insertion in model container [2022-04-27 10:16:55,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:55" (1/1) ... [2022-04-27 10:16:55,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:16:55,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:16:55,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c[328,341] [2022-04-27 10:16:56,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:56,007 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:16:56,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-1.c[328,341] [2022-04-27 10:16:56,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:56,049 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:16:56,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56 WrapperNode [2022-04-27 10:16:56,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:56,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:16:56,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:16:56,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:16:56,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:16:56,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:16:56,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:16:56,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:16:56,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:56,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:56,126 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-04-27 10:16:56,143 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-04-27 10:16:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:16:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:16:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:16:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:16:56,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:16:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:16:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:16:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:16:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:16:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:16:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:16:56,234 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:16:56,235 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:16:56,425 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:16:56,430 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:16:56,430 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 10:16:56,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:56 BoogieIcfgContainer [2022-04-27 10:16:56,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:16:56,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:16:56,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:16:56,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:16:56,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:16:55" (1/3) ... [2022-04-27 10:16:56,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6df7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:56, skipping insertion in model container [2022-04-27 10:16:56,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (2/3) ... [2022-04-27 10:16:56,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6df7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:56, skipping insertion in model container [2022-04-27 10:16:56,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:56" (3/3) ... [2022-04-27 10:16:56,437 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-1.c [2022-04-27 10:16:56,447 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:16:56,447 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:16:56,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:16:56,483 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d713ad5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12ab2a49 [2022-04-27 10:16:56,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:16:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:16:56,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:56,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:56,495 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:56,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:56,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1898607287, now seen corresponding path program 1 times [2022-04-27 10:16:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:56,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835869673] [2022-04-27 10:16:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:56,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {36#true} is VALID [2022-04-27 10:16:56,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 10:16:56,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #94#return; {36#true} is VALID [2022-04-27 10:16:56,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:56,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {36#true} is VALID [2022-04-27 10:16:56,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 10:16:56,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #94#return; {36#true} is VALID [2022-04-27 10:16:56,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret15 := main(); {36#true} is VALID [2022-04-27 10:16:56,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {41#(= main_~j~0 0)} is VALID [2022-04-27 10:16:56,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {41#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:16:56,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~j~0 := 1; {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:16:56,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:16:56,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~k~0 := 1; {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:16:56,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {42#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {37#false} is VALID [2022-04-27 10:16:56,737 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {37#false} is VALID [2022-04-27 10:16:56,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-27 10:16:56,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-27 10:16:56,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-27 10:16:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:56,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835869673] [2022-04-27 10:16:56,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835869673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:56,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:56,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:16:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923420296] [2022-04-27 10:16:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:56,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:16:56,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:56,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:56,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:56,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:16:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:56,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:16:56,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:16:56,792 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,146 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-04-27 10:16:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:16:57,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:16:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-04-27 10:16:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-04-27 10:16:57,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 92 transitions. [2022-04-27 10:16:57,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:57,273 INFO L225 Difference]: With dead ends: 67 [2022-04-27 10:16:57,273 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 10:16:57,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:16:57,278 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:57,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 47 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 10:16:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-27 10:16:57,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:57,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:57,316 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:57,316 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,319 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 10:16:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-27 10:16:57,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-27 10:16:57,320 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-27 10:16:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,323 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 10:16:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-27 10:16:57,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:57,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-27 10:16:57,326 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2022-04-27 10:16:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:57,326 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-27 10:16:57,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-27 10:16:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:16:57,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:57,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:57,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:16:57,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:57,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1409532089, now seen corresponding path program 1 times [2022-04-27 10:16:57,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:57,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985491395] [2022-04-27 10:16:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {237#true} is VALID [2022-04-27 10:16:57,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume true; {237#true} is VALID [2022-04-27 10:16:57,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {237#true} {237#true} #94#return; {237#true} is VALID [2022-04-27 10:16:57,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:57,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {237#true} is VALID [2022-04-27 10:16:57,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2022-04-27 10:16:57,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #94#return; {237#true} is VALID [2022-04-27 10:16:57,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret15 := main(); {237#true} is VALID [2022-04-27 10:16:57,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {237#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {242#(= main_~j~0 0)} is VALID [2022-04-27 10:16:57,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {242#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {242#(= main_~j~0 0)} is VALID [2022-04-27 10:16:57,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {242#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {243#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:16:57,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {244#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:16:57,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {244#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {244#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:16:57,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {244#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {244#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:16:57,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {244#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {245#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 10:16:57,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {238#false} is VALID [2022-04-27 10:16:57,485 INFO L272 TraceCheckUtils]: 13: Hoare triple {238#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {238#false} is VALID [2022-04-27 10:16:57,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2022-04-27 10:16:57,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {238#false} assume 0 == ~cond; {238#false} is VALID [2022-04-27 10:16:57,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {238#false} assume !false; {238#false} is VALID [2022-04-27 10:16:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:57,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:57,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985491395] [2022-04-27 10:16:57,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985491395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:57,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095036290] [2022-04-27 10:16:57,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:57,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:57,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:57,507 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-04-27 10:16:57,562 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-04-27 10:16:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:16:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:58,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2022-04-27 10:16:58,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#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); {237#true} is VALID [2022-04-27 10:16:58,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2022-04-27 10:16:58,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #94#return; {237#true} is VALID [2022-04-27 10:16:58,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret15 := main(); {237#true} is VALID [2022-04-27 10:16:58,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {237#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {237#true} is VALID [2022-04-27 10:16:58,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {237#true} is VALID [2022-04-27 10:16:58,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {237#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {237#true} is VALID [2022-04-27 10:16:58,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {237#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {237#true} is VALID [2022-04-27 10:16:58,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#true} ~j~0 := 1; {243#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:16:58,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {244#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:16:58,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {244#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {245#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 10:16:58,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {245#(and (= (+ (- 1) main_~k~0) 0) (<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {238#false} is VALID [2022-04-27 10:16:58,037 INFO L272 TraceCheckUtils]: 13: Hoare triple {238#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {238#false} is VALID [2022-04-27 10:16:58,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2022-04-27 10:16:58,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {238#false} assume 0 == ~cond; {238#false} is VALID [2022-04-27 10:16:58,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {238#false} assume !false; {238#false} is VALID [2022-04-27 10:16:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:16:58,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:16:58,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095036290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:58,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:16:58,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-04-27 10:16:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486028672] [2022-04-27 10:16:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:16:58,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:58,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:58,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:16:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:58,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:16:58,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:16:58,053 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,145 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-27 10:16:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:16:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:16:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-27 10:16:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-27 10:16:58,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-04-27 10:16:58,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:58,190 INFO L225 Difference]: With dead ends: 49 [2022-04-27 10:16:58,191 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 10:16:58,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:16:58,192 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:58,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:16:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 10:16:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-04-27 10:16:58,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:58,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:58,197 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:58,198 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,199 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-27 10:16:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-27 10:16:58,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-27 10:16:58,200 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-27 10:16:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,202 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-27 10:16:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-27 10:16:58,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:58,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:16:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-27 10:16:58,203 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 17 [2022-04-27 10:16:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:58,204 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-27 10:16:58,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-27 10:16:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:16:58,204 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:58,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:58,226 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-04-27 10:16:58,423 WARN L477 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-04-27 10:16:58,424 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:58,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1131787334, now seen corresponding path program 1 times [2022-04-27 10:16:58,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:58,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816629064] [2022-04-27 10:16:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {483#true} is VALID [2022-04-27 10:16:58,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} assume true; {483#true} is VALID [2022-04-27 10:16:58,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {483#true} {483#true} #94#return; {483#true} is VALID [2022-04-27 10:16:58,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:58,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {483#true} is VALID [2022-04-27 10:16:58,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2022-04-27 10:16:58,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #94#return; {483#true} is VALID [2022-04-27 10:16:58,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret15 := main(); {483#true} is VALID [2022-04-27 10:16:58,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {488#(= main_~j~0 0)} is VALID [2022-04-27 10:16:58,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {488#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {489#(and (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1) (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296)))) (= main_~j~0 0))} is VALID [2022-04-27 10:16:58,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#(and (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1) (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296)))) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {490#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (+ main_~SIZE~0 (* (div (+ (* (- 1) main_~j~0) 1) 4294967296) 4294967296))))} is VALID [2022-04-27 10:16:58,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (+ main_~SIZE~0 (* (div (+ (* (- 1) main_~j~0) 1) 4294967296) 4294967296))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {491#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-27 10:16:58,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {492#(and (= (+ (- 1) main_~j~0) 0) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 10:16:58,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {492#(and (= (+ (- 1) main_~j~0) 0) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {484#false} is VALID [2022-04-27 10:16:58,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#false} #t~short10 := ~i~0 >= 0; {484#false} is VALID [2022-04-27 10:16:58,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {484#false} is VALID [2022-04-27 10:16:58,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {484#false} is VALID [2022-04-27 10:16:58,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {484#false} is VALID [2022-04-27 10:16:58,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {484#false} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {484#false} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {484#false} ~k~0 := 1; {484#false} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {484#false} is VALID [2022-04-27 10:16:58,653 INFO L272 TraceCheckUtils]: 19: Hoare triple {484#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {484#false} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {484#false} assume 0 == ~cond; {484#false} is VALID [2022-04-27 10:16:58,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {484#false} assume !false; {484#false} is VALID [2022-04-27 10:16:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:58,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816629064] [2022-04-27 10:16:58,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816629064] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:58,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388383930] [2022-04-27 10:16:58,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:58,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:58,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:58,669 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-04-27 10:16:58,700 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-04-27 10:16:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:16:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:58,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2022-04-27 10:16:58,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#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); {483#true} is VALID [2022-04-27 10:16:58,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2022-04-27 10:16:58,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #94#return; {483#true} is VALID [2022-04-27 10:16:58,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret15 := main(); {483#true} is VALID [2022-04-27 10:16:58,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {488#(= main_~j~0 0)} is VALID [2022-04-27 10:16:58,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {488#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {488#(= main_~j~0 0)} is VALID [2022-04-27 10:16:58,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {488#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {518#(= main_~j~0 1)} is VALID [2022-04-27 10:16:58,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {518#(= main_~j~0 1)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {491#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-27 10:16:58,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {492#(and (= (+ (- 1) main_~j~0) 0) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 10:16:58,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {492#(and (= (+ (- 1) main_~j~0) 0) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {484#false} is VALID [2022-04-27 10:16:58,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#false} #t~short10 := ~i~0 >= 0; {484#false} is VALID [2022-04-27 10:16:58,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {484#false} is VALID [2022-04-27 10:16:58,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {484#false} is VALID [2022-04-27 10:16:58,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {484#false} is VALID [2022-04-27 10:16:58,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {484#false} is VALID [2022-04-27 10:16:58,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {484#false} is VALID [2022-04-27 10:16:58,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {484#false} ~k~0 := 1; {484#false} is VALID [2022-04-27 10:16:58,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {484#false} is VALID [2022-04-27 10:16:58,988 INFO L272 TraceCheckUtils]: 19: Hoare triple {484#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {484#false} is VALID [2022-04-27 10:16:58,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2022-04-27 10:16:58,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {484#false} assume 0 == ~cond; {484#false} is VALID [2022-04-27 10:16:58,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {484#false} assume !false; {484#false} is VALID [2022-04-27 10:16:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:58,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:16,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {484#false} assume !false; {484#false} is VALID [2022-04-27 10:17:16,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {484#false} assume 0 == ~cond; {484#false} is VALID [2022-04-27 10:17:16,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2022-04-27 10:17:16,687 INFO L272 TraceCheckUtils]: 19: Hoare triple {484#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {484#false} is VALID [2022-04-27 10:17:16,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {484#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {484#false} is VALID [2022-04-27 10:17:16,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {484#false} ~k~0 := 1; {484#false} is VALID [2022-04-27 10:17:16,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {484#false} is VALID [2022-04-27 10:17:16,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {484#false} is VALID [2022-04-27 10:17:16,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {484#false} is VALID [2022-04-27 10:17:16,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {484#false} is VALID [2022-04-27 10:17:16,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {484#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {484#false} is VALID [2022-04-27 10:17:16,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#false} #t~short10 := ~i~0 >= 0; {484#false} is VALID [2022-04-27 10:17:16,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {600#(not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {484#false} is VALID [2022-04-27 10:17:16,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {600#(not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-27 10:17:18,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {607#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (< (mod main_~j~0 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296)) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {491#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-27 10:17:18,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {611#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56) (< (mod (+ main_~j~0 1) 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296))))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {607#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (< (mod main_~j~0 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296)) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56)))} is VALID [2022-04-27 10:17:18,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {611#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56) (< (mod (+ main_~j~0 1) 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {611#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56) (< (mod (+ main_~j~0 1) 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296))))} is VALID [2022-04-27 10:17:18,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {611#(forall ((aux_div_aux_mod_main_~SIZE~0_29_56 Int) (aux_mod_aux_mod_main_~SIZE~0_29_56 Int)) (or (<= 0 aux_div_aux_mod_main_~SIZE~0_29_56) (<= (+ 4294967295 (* aux_div_aux_mod_main_~SIZE~0_29_56 4294967296) aux_mod_aux_mod_main_~SIZE~0_29_56) 0) (<= 4294967296 aux_mod_aux_mod_main_~SIZE~0_29_56) (< (mod (+ main_~j~0 1) 4294967296) (mod (+ (* 4294967295 aux_mod_aux_mod_main_~SIZE~0_29_56) 1) 4294967296))))} is VALID [2022-04-27 10:17:18,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret15 := main(); {483#true} is VALID [2022-04-27 10:17:18,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #94#return; {483#true} is VALID [2022-04-27 10:17:18,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2022-04-27 10:17:18,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#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); {483#true} is VALID [2022-04-27 10:17:18,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2022-04-27 10:17:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:18,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388383930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:18,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:18,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-04-27 10:17:18,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350997314] [2022-04-27 10:17:18,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:18,102 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 10:17:18,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:18,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:19,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:19,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:17:19,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:19,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:17:19,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=95, Unknown=3, NotChecked=0, Total=132 [2022-04-27 10:17:19,123 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:19,658 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 10:17:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:17:19,659 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 10:17:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-04-27 10:17:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-04-27 10:17:19,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 74 transitions. [2022-04-27 10:17:19,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:19,724 INFO L225 Difference]: With dead ends: 61 [2022-04-27 10:17:19,724 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 10:17:19,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=78, Invalid=225, Unknown=3, NotChecked=0, Total=306 [2022-04-27 10:17:19,726 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:19,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 68 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2022-04-27 10:17:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 10:17:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-04-27 10:17:19,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:19,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:19,735 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:19,735 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:19,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:19,736 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-27 10:17:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-04-27 10:17:19,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:19,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:19,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-04-27 10:17:19,737 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-04-27 10:17:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:19,738 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-27 10:17:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-04-27 10:17:19,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:19,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:19,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:19,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-27 10:17:19,740 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 23 [2022-04-27 10:17:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:19,740 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-27 10:17:19,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 10:17:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:17:19,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:19,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:19,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:19,941 WARN L477 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-04-27 10:17:19,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:19,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1068097608, now seen corresponding path program 2 times [2022-04-27 10:17:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:19,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572245982] [2022-04-27 10:17:19,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:19,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:20,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:20,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {853#true} is VALID [2022-04-27 10:17:20,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-27 10:17:20,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {853#true} {853#true} #94#return; {853#true} is VALID [2022-04-27 10:17:20,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:20,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {853#true} is VALID [2022-04-27 10:17:20,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-27 10:17:20,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #94#return; {853#true} is VALID [2022-04-27 10:17:20,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret15 := main(); {853#true} is VALID [2022-04-27 10:17:20,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {858#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:17:20,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {858#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {858#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:17:20,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {858#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {859#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:20,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {859#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {859#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:20,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {859#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {860#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:20,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {860#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:20,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {859#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:20,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {859#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {861#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-27 10:17:20,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {861#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {862#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (= (+ |main_~#v~0.offset| (* main_~i~0 4)) 0) (and (not |main_#t~short10|) (<= (+ main_~i~0 1) main_~j~0))))} is VALID [2022-04-27 10:17:20,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {862#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (= (+ |main_~#v~0.offset| (* main_~i~0 4)) 0) (and (not |main_#t~short10|) (<= (+ main_~i~0 1) main_~j~0))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {863#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-27 10:17:20,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {863#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {864#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-27 10:17:20,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {864#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {865#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:20,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {865#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:20,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:20,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {867#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-27 10:17:20,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {867#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {868#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:17:20,449 INFO L272 TraceCheckUtils]: 21: Hoare triple {868#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {869#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:17:20,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {869#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {870#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:17:20,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {870#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {854#false} is VALID [2022-04-27 10:17:20,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-27 10:17:20,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:20,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572245982] [2022-04-27 10:17:20,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572245982] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:20,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79844838] [2022-04-27 10:17:20,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:17:20,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:20,456 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-04-27 10:17:20,456 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-04-27 10:17:20,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:17:20,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:20,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 10:17:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:20,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:20,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:20,826 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-04-27 10:17:20,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:20,935 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-04-27 10:17:21,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2022-04-27 10:17:21,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#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); {853#true} is VALID [2022-04-27 10:17:21,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-27 10:17:21,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #94#return; {853#true} is VALID [2022-04-27 10:17:21,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret15 := main(); {853#true} is VALID [2022-04-27 10:17:21,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {860#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:21,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {860#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {860#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:21,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {860#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {860#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:21,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {860#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:21,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {860#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:21,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {860#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:21,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {860#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {859#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:21,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {859#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {911#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:21,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {911#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {915#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} is VALID [2022-04-27 10:17:21,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {915#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {919#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-27 10:17:21,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {919#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {923#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:21,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {923#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:21,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:21,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:21,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {866#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {867#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-27 10:17:21,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {867#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {868#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:17:21,055 INFO L272 TraceCheckUtils]: 21: Hoare triple {868#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:21,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:21,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {854#false} is VALID [2022-04-27 10:17:21,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-27 10:17:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:17:21,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:21,409 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-04-27 10:17:21,439 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-27 10:17:21,440 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-04-27 10:17:21,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-27 10:17:21,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {854#false} is VALID [2022-04-27 10:17:21,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:21,594 INFO L272 TraceCheckUtils]: 21: Hoare triple {868#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:21,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {965#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {868#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:17:21,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {969#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {965#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-27 10:17:21,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {969#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {969#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:17:21,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {969#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {969#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:17:21,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {979#(forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {969#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:17:21,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {983#(or |main_#t~short10| (forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4))))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {979#(forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-27 10:17:21,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {987#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {983#(or |main_#t~short10| (forall ((v_ArrVal_39 Int)) (or (not (<= main_~key~0 v_ArrVal_39)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_39) (+ |main_~#v~0.offset| 4))))))} is VALID [2022-04-27 10:17:21,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {991#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {987#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:21,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {995#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {991#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:21,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#true} ~j~0 := 1; {995#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-27 10:17:21,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {853#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {853#true} is VALID [2022-04-27 10:17:21,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {853#true} is VALID [2022-04-27 10:17:21,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {853#true} is VALID [2022-04-27 10:17:21,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {853#true} is VALID [2022-04-27 10:17:21,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {853#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {853#true} is VALID [2022-04-27 10:17:21,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {853#true} is VALID [2022-04-27 10:17:21,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret15 := main(); {853#true} is VALID [2022-04-27 10:17:21,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #94#return; {853#true} is VALID [2022-04-27 10:17:21,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-27 10:17:21,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#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); {853#true} is VALID [2022-04-27 10:17:21,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2022-04-27 10:17:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:17:21,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79844838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:21,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:21,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 29 [2022-04-27 10:17:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543032767] [2022-04-27 10:17:21,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:21,610 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:17:21,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:21,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:21,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:21,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 10:17:21,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:21,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 10:17:21,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-04-27 10:17:21,654 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:23,688 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2022-04-27 10:17:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 10:17:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 10:17:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 137 transitions. [2022-04-27 10:17:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 137 transitions. [2022-04-27 10:17:23,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 137 transitions. [2022-04-27 10:17:23,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:23,837 INFO L225 Difference]: With dead ends: 106 [2022-04-27 10:17:23,838 INFO L226 Difference]: Without dead ends: 87 [2022-04-27 10:17:23,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=579, Invalid=2613, Unknown=0, NotChecked=0, Total=3192 [2022-04-27 10:17:23,839 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 141 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:23,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 87 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 589 Invalid, 0 Unknown, 129 Unchecked, 0.7s Time] [2022-04-27 10:17:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-27 10:17:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 50. [2022-04-27 10:17:23,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:23,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:23,881 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:23,881 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:23,886 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-04-27 10:17:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2022-04-27 10:17:23,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:23,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:23,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 87 states. [2022-04-27 10:17:23,891 INFO L87 Difference]: Start difference. First operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 87 states. [2022-04-27 10:17:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:23,897 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-04-27 10:17:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2022-04-27 10:17:23,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:23,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:23,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:23,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2022-04-27 10:17:23,899 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 25 [2022-04-27 10:17:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:23,899 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2022-04-27 10:17:23,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 26 states have internal predecessors, (47), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-04-27 10:17:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 10:17:23,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:23,900 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:23,919 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-04-27 10:17:24,116 WARN L477 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-04-27 10:17:24,117 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:24,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1586594931, now seen corresponding path program 1 times [2022-04-27 10:17:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:24,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154335240] [2022-04-27 10:17:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:24,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:24,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {1498#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {1476#true} is VALID [2022-04-27 10:17:24,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-27 10:17:24,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1476#true} {1476#true} #94#return; {1476#true} is VALID [2022-04-27 10:17:24,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {1476#true} call ULTIMATE.init(); {1498#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:24,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {1498#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {1476#true} is VALID [2022-04-27 10:17:24,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-27 10:17:24,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1476#true} {1476#true} #94#return; {1476#true} is VALID [2022-04-27 10:17:24,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {1476#true} call #t~ret15 := main(); {1476#true} is VALID [2022-04-27 10:17:24,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {1476#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1481#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:17:24,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {1481#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1481#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:17:24,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {1481#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1482#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:24,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {1482#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1482#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:24,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {1482#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1483#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:24,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {1483#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1483#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:24,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1482#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:24,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {1482#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1484#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (= 0 (* main_~i~0 4))))} is VALID [2022-04-27 10:17:24,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {1484#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {1485#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (<= 0 main_~i~0)) (or (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (= 0 (* main_~i~0 4))))} is VALID [2022-04-27 10:17:24,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {1485#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (<= 0 main_~i~0)) (or (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (= 0 (* main_~i~0 4))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {1486#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (or (and (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (not |main_#t~short10|)))} is VALID [2022-04-27 10:17:24,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {1486#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (or (and (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (not |main_#t~short10|)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {1487#(and (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:24,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {1487#(and (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= 0 main_~i~0))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {1488#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:24,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {1488#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~i~0 := ~i~0 - 1; {1489#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-27 10:17:24,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {1489#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {1490#(and (= |main_~#v~0.offset| 0) (or (and (= (+ (- 1) main_~j~0) 0) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))) |main_#t~short10|))} is VALID [2022-04-27 10:17:24,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {1490#(and (= |main_~#v~0.offset| 0) (or (and (= (+ (- 1) main_~j~0) 0) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1))) |main_#t~short10|))} assume !#t~short10; {1491#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-27 10:17:24,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {1491#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1491#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-27 10:17:24,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {1491#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1492#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:24,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {1492#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1493#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:24,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {1493#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1493#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:24,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {1493#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {1494#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-27 10:17:24,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {1494#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1495#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:17:24,658 INFO L272 TraceCheckUtils]: 26: Hoare triple {1495#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:17:24,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {1496#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1497#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:17:24,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {1497#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1477#false} is VALID [2022-04-27 10:17:24,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {1477#false} assume !false; {1477#false} is VALID [2022-04-27 10:17:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:24,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:24,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154335240] [2022-04-27 10:17:24,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154335240] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:24,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501171358] [2022-04-27 10:17:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:24,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:24,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:24,660 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-04-27 10:17:24,661 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-04-27 10:17:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:24,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 10:17:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:24,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:24,984 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-27 10:17:24,985 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-04-27 10:17:25,670 INFO L356 Elim1Store]: treesize reduction 108, result has 10.0 percent of original size [2022-04-27 10:17:25,670 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-04-27 10:17:26,693 INFO L356 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2022-04-27 10:17:26,693 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-04-27 10:17:26,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {1476#true} call ULTIMATE.init(); {1476#true} is VALID [2022-04-27 10:17:26,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {1476#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); {1476#true} is VALID [2022-04-27 10:17:26,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-27 10:17:26,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1476#true} {1476#true} #94#return; {1476#true} is VALID [2022-04-27 10:17:26,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {1476#true} call #t~ret15 := main(); {1476#true} is VALID [2022-04-27 10:17:26,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {1476#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1476#true} is VALID [2022-04-27 10:17:26,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {1476#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1476#true} is VALID [2022-04-27 10:17:26,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {1476#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1476#true} is VALID [2022-04-27 10:17:26,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {1476#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1476#true} is VALID [2022-04-27 10:17:26,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {1476#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1476#true} is VALID [2022-04-27 10:17:26,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {1476#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1476#true} is VALID [2022-04-27 10:17:26,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {1476#true} ~j~0 := 1; {1535#(<= main_~j~0 1)} is VALID [2022-04-27 10:17:26,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {1535#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1539#(<= main_~i~0 0)} is VALID [2022-04-27 10:17:26,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(<= main_~i~0 0)} #t~short10 := ~i~0 >= 0; {1543#(and (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-27 10:17:26,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {1543#(and (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {1547#(and (<= main_~i~0 0) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:26,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {1547#(and (<= main_~i~0 0) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (<= 0 main_~i~0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {1551#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:26,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {1551#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= main_~i~0 0) (<= 0 main_~i~0))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {1555#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:26,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (<= 0 main_~i~0))} ~i~0 := ~i~0 - 1; {1559#(exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= v_main_~i~0_13 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} is VALID [2022-04-27 10:17:26,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {1559#(exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= v_main_~i~0_13 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} #t~short10 := ~i~0 >= 0; {1563#(and (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= v_main_~i~0_13 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-27 10:17:26,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {1563#(and (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= v_main_~i~0_13 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {1567#(and (< main_~i~0 0) (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))))} is VALID [2022-04-27 10:17:26,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (< main_~i~0 0) (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1567#(and (< main_~i~0 0) (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))))} is VALID [2022-04-27 10:17:26,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (< main_~i~0 0) (exists ((v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1574#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} is VALID [2022-04-27 10:17:26,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1574#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} is VALID [2022-04-27 10:17:26,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {1574#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1574#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} is VALID [2022-04-27 10:17:26,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {1574#(exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13)))} ~k~0 := 1; {1584#(and (exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))) (= main_~k~0 1))} is VALID [2022-04-27 10:17:26,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {1584#(and (exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= v_main_~i~0_13 (+ main_~i~0 1)) (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_13 4) 4))) (<= 0 v_main_~i~0_13))) (= main_~k~0 1))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1588#(< |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:17:26,869 INFO L272 TraceCheckUtils]: 26: Hoare triple {1588#(< |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:26,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:26,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {1596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1477#false} is VALID [2022-04-27 10:17:26,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {1477#false} assume !false; {1477#false} is VALID [2022-04-27 10:17:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:17:26,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:29,623 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-04-27 10:17:29,694 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-27 10:17:29,694 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-04-27 10:17:31,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {1477#false} assume !false; {1477#false} is VALID [2022-04-27 10:17:31,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {1596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1477#false} is VALID [2022-04-27 10:17:31,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:31,614 INFO L272 TraceCheckUtils]: 26: Hoare triple {1495#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:31,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {1615#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {1495#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:17:31,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {1619#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {1615#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-27 10:17:31,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1619#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:17:31,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1619#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:17:31,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {1629#(forall ((v_ArrVal_64 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_64 main_~key~0))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1619#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:17:31,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {1629#(forall ((v_ArrVal_64 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_64 main_~key~0))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1629#(forall ((v_ArrVal_64 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_64 main_~key~0))))} is VALID [2022-04-27 10:17:31,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {1636#(or (forall ((v_ArrVal_64 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_64 main_~key~0)))) |main_#t~short10|)} assume !#t~short10; {1629#(forall ((v_ArrVal_64 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_64 main_~key~0))))} is VALID [2022-04-27 10:17:31,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {1640#(or (forall ((v_ArrVal_64 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_64 main_~key~0)))) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {1636#(or (forall ((v_ArrVal_64 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_64 main_~key~0)))) |main_#t~short10|)} is VALID [2022-04-27 10:17:31,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {1644#(forall ((v_main_~i~0_14 Int)) (or (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (forall ((v_ArrVal_64 Int)) (or (not (<= v_ArrVal_64 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) (+ |main_~#v~0.offset| 4))))) (<= 0 v_main_~i~0_14)))} ~i~0 := ~i~0 - 1; {1640#(or (forall ((v_ArrVal_64 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= v_ArrVal_64 main_~key~0)))) (<= 0 main_~i~0))} is VALID [2022-04-27 10:17:31,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {1648#(forall ((v_main_~i~0_14 Int) (v_ArrVal_64 Int) (v_ArrVal_61 Int)) (or (not (<= v_ArrVal_64 main_~key~0)) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_61)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_61) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_61) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= 0 v_main_~i~0_14)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {1644#(forall ((v_main_~i~0_14 Int)) (or (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (forall ((v_ArrVal_64 Int)) (or (not (<= v_ArrVal_64 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) (+ |main_~#v~0.offset| 4))))) (<= 0 v_main_~i~0_14)))} is VALID [2022-04-27 10:17:31,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#(or (not |main_#t~short10|) (forall ((v_main_~i~0_14 Int) (v_ArrVal_64 Int) (v_ArrVal_61 Int)) (or (not (<= v_ArrVal_64 main_~key~0)) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_61)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_61) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_61) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= 0 v_main_~i~0_14))))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {1648#(forall ((v_main_~i~0_14 Int) (v_ArrVal_64 Int) (v_ArrVal_61 Int)) (or (not (<= v_ArrVal_64 main_~key~0)) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_61)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_61) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_61) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= 0 v_main_~i~0_14)))} is VALID [2022-04-27 10:17:31,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {1656#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {1652#(or (not |main_#t~short10|) (forall ((v_main_~i~0_14 Int) (v_ArrVal_64 Int) (v_ArrVal_61 Int)) (or (not (<= v_ArrVal_64 main_~key~0)) (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_61)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_61) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_61) (+ (* v_main_~i~0_14 4) |main_~#v~0.offset| 4) v_ArrVal_64) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_14 1))) (<= 0 v_main_~i~0_14))))} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {1476#true} #t~short10 := ~i~0 >= 0; {1656#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {1476#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {1476#true} ~j~0 := 1; {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {1476#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {1476#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {1476#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {1476#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {1476#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {1476#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {1476#true} call #t~ret15 := main(); {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1476#true} {1476#true} #94#return; {1476#true} is VALID [2022-04-27 10:17:31,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {1476#true} assume true; {1476#true} is VALID [2022-04-27 10:17:31,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {1476#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); {1476#true} is VALID [2022-04-27 10:17:31,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {1476#true} call ULTIMATE.init(); {1476#true} is VALID [2022-04-27 10:17:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 10:17:31,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501171358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:31,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:31,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 14] total 43 [2022-04-27 10:17:31,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930226431] [2022-04-27 10:17:31,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 10:17:31,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:31,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:31,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:31,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-27 10:17:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:31,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-27 10:17:31,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1603, Unknown=3, NotChecked=0, Total=1806 [2022-04-27 10:17:31,687 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:50,271 INFO L93 Difference]: Finished difference Result 115 states and 141 transitions. [2022-04-27 10:17:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-27 10:17:50,272 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 10:17:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 116 transitions. [2022-04-27 10:17:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 116 transitions. [2022-04-27 10:17:50,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 116 transitions. [2022-04-27 10:17:50,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:50,394 INFO L225 Difference]: With dead ends: 115 [2022-04-27 10:17:50,394 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 10:17:50,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=623, Invalid=5066, Unknown=11, NotChecked=0, Total=5700 [2022-04-27 10:17:50,396 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 98 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:50,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 184 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 602 Invalid, 0 Unknown, 461 Unchecked, 0.6s Time] [2022-04-27 10:17:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 10:17:50,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 58. [2022-04-27 10:17:50,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:50,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 58 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:50,441 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 58 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:50,441 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 58 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:50,447 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2022-04-27 10:17:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2022-04-27 10:17:50,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:50,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:50,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 113 states. [2022-04-27 10:17:50,449 INFO L87 Difference]: Start difference. First operand has 58 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 113 states. [2022-04-27 10:17:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:50,452 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2022-04-27 10:17:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2022-04-27 10:17:50,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:50,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:50,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:50,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-04-27 10:17:50,454 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 30 [2022-04-27 10:17:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:50,454 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-04-27 10:17:50,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-27 10:17:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 10:17:50,455 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:50,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:50,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 10:17:50,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:50,673 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:50,674 INFO L85 PathProgramCache]: Analyzing trace with hash 932991851, now seen corresponding path program 3 times [2022-04-27 10:17:50,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:50,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369607928] [2022-04-27 10:17:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:50,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:50,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {2241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {2230#true} is VALID [2022-04-27 10:17:50,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 10:17:50,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2230#true} {2230#true} #94#return; {2230#true} is VALID [2022-04-27 10:17:50,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:50,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {2241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {2230#true} is VALID [2022-04-27 10:17:50,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 10:17:50,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #94#return; {2230#true} is VALID [2022-04-27 10:17:50,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret15 := main(); {2230#true} is VALID [2022-04-27 10:17:50,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2235#(= main_~j~0 0)} is VALID [2022-04-27 10:17:50,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {2235#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2235#(= main_~j~0 0)} is VALID [2022-04-27 10:17:50,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {2235#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2236#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:50,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {2236#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2236#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:50,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {2236#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2237#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:17:50,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {2237#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2238#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:17:50,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {2238#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:50,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:50,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:50,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:50,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:50,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:50,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2240#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:17:50,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {2240#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2231#false} is VALID [2022-04-27 10:17:50,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {2231#false} #t~short10 := ~i~0 >= 0; {2231#false} is VALID [2022-04-27 10:17:50,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2231#false} is VALID [2022-04-27 10:17:50,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {2231#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2231#false} is VALID [2022-04-27 10:17:50,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {2231#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2231#false} is VALID [2022-04-27 10:17:50,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {2231#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2231#false} is VALID [2022-04-27 10:17:50,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {2231#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2231#false} is VALID [2022-04-27 10:17:50,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {2231#false} ~k~0 := 1; {2231#false} is VALID [2022-04-27 10:17:50,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {2231#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2231#false} is VALID [2022-04-27 10:17:50,825 INFO L272 TraceCheckUtils]: 27: Hoare triple {2231#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2231#false} is VALID [2022-04-27 10:17:50,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {2231#false} ~cond := #in~cond; {2231#false} is VALID [2022-04-27 10:17:50,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {2231#false} assume 0 == ~cond; {2231#false} is VALID [2022-04-27 10:17:50,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-27 10:17:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:50,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369607928] [2022-04-27 10:17:50,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369607928] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:50,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207787268] [2022-04-27 10:17:50,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:17:50,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:50,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:50,827 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-04-27 10:17:50,828 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-04-27 10:17:50,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 10:17:50,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:50,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:17:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:50,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:51,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-27 10:17:51,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#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); {2230#true} is VALID [2022-04-27 10:17:51,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 10:17:51,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #94#return; {2230#true} is VALID [2022-04-27 10:17:51,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret15 := main(); {2230#true} is VALID [2022-04-27 10:17:51,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2235#(= main_~j~0 0)} is VALID [2022-04-27 10:17:51,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {2235#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2235#(= main_~j~0 0)} is VALID [2022-04-27 10:17:51,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {2235#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2236#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:51,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {2236#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2236#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:51,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {2236#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2272#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-27 10:17:51,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {2272#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2238#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:17:51,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {2238#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:51,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:51,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:51,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:51,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:51,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:51,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {2239#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2297#(and (= (+ (- 2) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:51,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {2297#(and (= (+ (- 2) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2231#false} is VALID [2022-04-27 10:17:51,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {2231#false} #t~short10 := ~i~0 >= 0; {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {2231#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {2231#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {2231#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {2231#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {2231#false} ~k~0 := 1; {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {2231#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L272 TraceCheckUtils]: 27: Hoare triple {2231#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {2231#false} ~cond := #in~cond; {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {2231#false} assume 0 == ~cond; {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-27 10:17:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:51,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {2231#false} assume 0 == ~cond; {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {2231#false} ~cond := #in~cond; {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L272 TraceCheckUtils]: 27: Hoare triple {2231#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {2231#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {2231#false} ~k~0 := 1; {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {2231#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {2231#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {2231#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {2231#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#false} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2231#false} is VALID [2022-04-27 10:17:51,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {2231#false} #t~short10 := ~i~0 >= 0; {2231#false} is VALID [2022-04-27 10:17:51,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {2240#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2231#false} is VALID [2022-04-27 10:17:51,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2240#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:17:51,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:51,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:51,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:51,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:51,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:51,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {2238#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2376#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:51,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {2398#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2238#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:17:51,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {2402#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2398#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-27 10:17:51,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {2402#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2402#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-27 10:17:51,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {2409#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2402#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-27 10:17:51,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {2409#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {2409#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-27 10:17:51,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {2230#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {2409#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-27 10:17:51,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {2230#true} call #t~ret15 := main(); {2230#true} is VALID [2022-04-27 10:17:51,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2230#true} {2230#true} #94#return; {2230#true} is VALID [2022-04-27 10:17:51,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {2230#true} assume true; {2230#true} is VALID [2022-04-27 10:17:51,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {2230#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); {2230#true} is VALID [2022-04-27 10:17:51,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {2230#true} call ULTIMATE.init(); {2230#true} is VALID [2022-04-27 10:17:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:51,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207787268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:51,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:51,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-27 10:17:51,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727950835] [2022-04-27 10:17:51,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:51,758 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:17:51,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:51,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:51,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:51,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 10:17:51,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:51,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 10:17:51,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:17:51,797 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:52,592 INFO L93 Difference]: Finished difference Result 173 states and 222 transitions. [2022-04-27 10:17:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:17:52,592 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 10:17:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 10:17:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 10:17:52,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-27 10:17:52,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:52,678 INFO L225 Difference]: With dead ends: 173 [2022-04-27 10:17:52,678 INFO L226 Difference]: Without dead ends: 130 [2022-04-27 10:17:52,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:17:52,679 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 137 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:52,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 75 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:17:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-27 10:17:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2022-04-27 10:17:52,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:52,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:52,751 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:52,752 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:52,754 INFO L93 Difference]: Finished difference Result 130 states and 166 transitions. [2022-04-27 10:17:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2022-04-27 10:17:52,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:52,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:52,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 130 states. [2022-04-27 10:17:52,755 INFO L87 Difference]: Start difference. First operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 130 states. [2022-04-27 10:17:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:52,757 INFO L93 Difference]: Finished difference Result 130 states and 166 transitions. [2022-04-27 10:17:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2022-04-27 10:17:52,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:52,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:52,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:52,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 74 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2022-04-27 10:17:52,759 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 31 [2022-04-27 10:17:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:52,759 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2022-04-27 10:17:52,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-04-27 10:17:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 10:17:52,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:52,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:52,778 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-04-27 10:17:52,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:52,976 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash 912710034, now seen corresponding path program 1 times [2022-04-27 10:17:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:52,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756568269] [2022-04-27 10:17:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:53,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:53,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {3054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {3039#true} is VALID [2022-04-27 10:17:53,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {3039#true} assume true; {3039#true} is VALID [2022-04-27 10:17:53,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3039#true} {3039#true} #94#return; {3039#true} is VALID [2022-04-27 10:17:53,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-27 10:17:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:53,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {3039#true} ~cond := #in~cond; {3039#true} is VALID [2022-04-27 10:17:53,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {3039#true} assume !(0 == ~cond); {3039#true} is VALID [2022-04-27 10:17:53,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {3039#true} assume true; {3039#true} is VALID [2022-04-27 10:17:53,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3039#true} {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #92#return; {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-27 10:17:53,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {3039#true} call ULTIMATE.init(); {3054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:53,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {3054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {3039#true} is VALID [2022-04-27 10:17:53,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {3039#true} assume true; {3039#true} is VALID [2022-04-27 10:17:53,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3039#true} {3039#true} #94#return; {3039#true} is VALID [2022-04-27 10:17:53,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {3039#true} call #t~ret15 := main(); {3039#true} is VALID [2022-04-27 10:17:53,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {3039#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3044#(= main_~j~0 0)} is VALID [2022-04-27 10:17:53,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {3044#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3044#(= main_~j~0 0)} is VALID [2022-04-27 10:17:53,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {3044#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3045#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:53,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {3045#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3045#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:53,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {3045#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3046#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-27 10:17:53,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {3046#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:53,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:53,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:53,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} #t~short10 := ~i~0 >= 0; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:53,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:53,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:53,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:53,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:53,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:53,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~k~0 := 1; {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-27 10:17:53,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-27 10:17:53,125 INFO L272 TraceCheckUtils]: 21: Hoare triple {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3039#true} is VALID [2022-04-27 10:17:53,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {3039#true} ~cond := #in~cond; {3039#true} is VALID [2022-04-27 10:17:53,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {3039#true} assume !(0 == ~cond); {3039#true} is VALID [2022-04-27 10:17:53,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {3039#true} assume true; {3039#true} is VALID [2022-04-27 10:17:53,125 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3039#true} {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #92#return; {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-27 10:17:53,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} havoc #t~mem13;havoc #t~mem14; {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-27 10:17:53,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3053#(<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:17:53,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {3053#(<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3040#false} is VALID [2022-04-27 10:17:53,127 INFO L272 TraceCheckUtils]: 29: Hoare triple {3040#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3040#false} is VALID [2022-04-27 10:17:53,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {3040#false} ~cond := #in~cond; {3040#false} is VALID [2022-04-27 10:17:53,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {3040#false} assume 0 == ~cond; {3040#false} is VALID [2022-04-27 10:17:53,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {3040#false} assume !false; {3040#false} is VALID [2022-04-27 10:17:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:53,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:53,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756568269] [2022-04-27 10:17:53,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756568269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:53,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862692506] [2022-04-27 10:17:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:53,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:53,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:53,129 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-04-27 10:17:53,130 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-04-27 10:17:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:53,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:17:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:53,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:54,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {3039#true} call ULTIMATE.init(); {3039#true} is VALID [2022-04-27 10:17:54,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {3039#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); {3039#true} is VALID [2022-04-27 10:17:54,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {3039#true} assume true; {3039#true} is VALID [2022-04-27 10:17:54,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3039#true} {3039#true} #94#return; {3039#true} is VALID [2022-04-27 10:17:54,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {3039#true} call #t~ret15 := main(); {3039#true} is VALID [2022-04-27 10:17:54,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {3039#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3044#(= main_~j~0 0)} is VALID [2022-04-27 10:17:54,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {3044#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3044#(= main_~j~0 0)} is VALID [2022-04-27 10:17:54,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {3044#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3045#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:54,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {3045#(and (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3045#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:54,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {3045#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3046#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-27 10:17:54,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {3046#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:54,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:54,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:54,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} #t~short10 := ~i~0 >= 0; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:54,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:54,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:54,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:54,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:54,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:54,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~k~0 := 1; {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-27 10:17:54,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-27 10:17:54,495 INFO L272 TraceCheckUtils]: 21: Hoare triple {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3039#true} is VALID [2022-04-27 10:17:54,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {3039#true} ~cond := #in~cond; {3039#true} is VALID [2022-04-27 10:17:54,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {3039#true} assume !(0 == ~cond); {3039#true} is VALID [2022-04-27 10:17:54,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {3039#true} assume true; {3039#true} is VALID [2022-04-27 10:17:54,496 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3039#true} {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #92#return; {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-27 10:17:54,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} havoc #t~mem13;havoc #t~mem14; {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-27 10:17:54,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {3048#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= (+ (- 1) main_~k~0) 0))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3139#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~k~0 2))} is VALID [2022-04-27 10:17:54,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {3139#(and (<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296)) (= main_~k~0 2))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3040#false} is VALID [2022-04-27 10:17:54,497 INFO L272 TraceCheckUtils]: 29: Hoare triple {3040#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3040#false} is VALID [2022-04-27 10:17:54,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {3040#false} ~cond := #in~cond; {3040#false} is VALID [2022-04-27 10:17:54,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {3040#false} assume 0 == ~cond; {3040#false} is VALID [2022-04-27 10:17:54,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {3040#false} assume !false; {3040#false} is VALID [2022-04-27 10:17:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:54,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:56,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {3040#false} assume !false; {3040#false} is VALID [2022-04-27 10:17:56,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {3040#false} assume 0 == ~cond; {3040#false} is VALID [2022-04-27 10:17:56,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {3040#false} ~cond := #in~cond; {3040#false} is VALID [2022-04-27 10:17:56,264 INFO L272 TraceCheckUtils]: 29: Hoare triple {3040#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3040#false} is VALID [2022-04-27 10:17:56,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {3053#(<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3040#false} is VALID [2022-04-27 10:17:56,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {3170#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3053#(<= (+ main_~SIZE~0 (* (div main_~k~0 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-27 10:17:56,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {3170#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} havoc #t~mem13;havoc #t~mem14; {3170#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:56,267 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3039#true} {3170#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #92#return; {3170#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:56,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {3039#true} assume true; {3039#true} is VALID [2022-04-27 10:17:56,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {3039#true} assume !(0 == ~cond); {3039#true} is VALID [2022-04-27 10:17:56,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {3039#true} ~cond := #in~cond; {3039#true} is VALID [2022-04-27 10:17:56,267 INFO L272 TraceCheckUtils]: 21: Hoare triple {3170#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3039#true} is VALID [2022-04-27 10:17:56,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {3170#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3170#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:56,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~k~0 := 1; {3170#(<= (+ main_~SIZE~0 (* (div (+ main_~k~0 1) 4294967296) 4294967296)) (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:56,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:56,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:56,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:56,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:56,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:56,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} #t~short10 := ~i~0 >= 0; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:56,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:56,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} ~j~0 := 1; {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:56,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {3222#(<= 0 (+ 1 (div (+ (- 4294967294) (* (- 1) (mod main_~j~0 4294967296))) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3047#(<= 0 (div (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0)) 4294967296))} is VALID [2022-04-27 10:17:56,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {3226#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3222#(<= 0 (+ 1 (div (+ (- 4294967294) (* (- 1) (mod main_~j~0 4294967296))) 4294967296)))} is VALID [2022-04-27 10:17:56,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {3226#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3226#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-27 10:17:56,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {3233#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3226#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-27 10:17:56,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {3233#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3233#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-27 10:17:56,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {3039#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3233#(<= 0 (+ (div (+ (* (- 1) (mod (+ main_~j~0 2) 4294967296)) (- 4294967294)) 4294967296) 1))} is VALID [2022-04-27 10:17:56,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {3039#true} call #t~ret15 := main(); {3039#true} is VALID [2022-04-27 10:17:56,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3039#true} {3039#true} #94#return; {3039#true} is VALID [2022-04-27 10:17:56,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {3039#true} assume true; {3039#true} is VALID [2022-04-27 10:17:56,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {3039#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); {3039#true} is VALID [2022-04-27 10:17:56,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {3039#true} call ULTIMATE.init(); {3039#true} is VALID [2022-04-27 10:17:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:17:56,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862692506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:56,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:56,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-04-27 10:17:56,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574502192] [2022-04-27 10:17:56,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:56,275 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-27 10:17:56,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:56,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:56,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:56,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:17:56,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:17:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:17:56,313 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:57,226 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2022-04-27 10:17:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:17:57,226 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-27 10:17:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-27 10:17:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-27 10:17:57,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-27 10:17:57,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:57,303 INFO L225 Difference]: With dead ends: 141 [2022-04-27 10:17:57,303 INFO L226 Difference]: Without dead ends: 122 [2022-04-27 10:17:57,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:17:57,304 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 143 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:57,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 74 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:17:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-27 10:17:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 98. [2022-04-27 10:17:57,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:57,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 98 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 91 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:57,424 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 98 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 91 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:57,424 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 98 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 91 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:57,427 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2022-04-27 10:17:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-04-27 10:17:57,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:57,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:57,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 91 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 122 states. [2022-04-27 10:17:57,427 INFO L87 Difference]: Start difference. First operand has 98 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 91 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 122 states. [2022-04-27 10:17:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:57,429 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2022-04-27 10:17:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-04-27 10:17:57,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:57,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:57,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:57,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 91 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2022-04-27 10:17:57,431 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 33 [2022-04-27 10:17:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:57,432 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2022-04-27 10:17:57,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-04-27 10:17:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 10:17:57,432 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:57,432 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:57,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:57,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:57,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:57,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1010087575, now seen corresponding path program 4 times [2022-04-27 10:17:57,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:57,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907606217] [2022-04-27 10:17:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:57,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:58,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {3852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {3831#true} is VALID [2022-04-27 10:17:58,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-27 10:17:58,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3831#true} {3831#true} #94#return; {3831#true} is VALID [2022-04-27 10:17:58,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:58,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {3852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {3831#true} is VALID [2022-04-27 10:17:58,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-27 10:17:58,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #94#return; {3831#true} is VALID [2022-04-27 10:17:58,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret15 := main(); {3831#true} is VALID [2022-04-27 10:17:58,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3836#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:17:58,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {3836#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3836#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:17:58,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {3836#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3837#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:58,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {3837#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3837#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:58,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {3837#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3838#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-27 10:17:58,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {3838#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {3839#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {3839#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {3839#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {3837#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:58,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {3837#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3840#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-27 10:17:58,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {3840#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {3841#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} is VALID [2022-04-27 10:17:58,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {3841#(and (= (+ (- 1) main_~j~0) 0) (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3842#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-27 10:17:58,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {3842#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3843#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-27 10:17:58,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {3843#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3844#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:58,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {3844#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3845#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-27 10:17:58,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {3845#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:58,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:58,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:58,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:58,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:58,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:58,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:58,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {3848#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-27 10:17:58,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3849#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:17:58,088 INFO L272 TraceCheckUtils]: 29: Hoare triple {3849#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3850#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:17:58,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {3850#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3851#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:17:58,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {3851#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3832#false} is VALID [2022-04-27 10:17:58,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-27 10:17:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907606217] [2022-04-27 10:17:58,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907606217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194332796] [2022-04-27 10:17:58,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:17:58,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:58,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:58,092 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:58,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 10:17:58,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:17:58,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:17:58,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 10:17:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:58,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:58,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:58,452 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-04-27 10:17:58,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:58,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:58,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:17:58,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:58,621 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 27 treesize of output 29 [2022-04-27 10:17:58,692 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:58,692 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-04-27 10:17:58,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3831#true} is VALID [2022-04-27 10:17:58,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#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); {3831#true} is VALID [2022-04-27 10:17:58,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-27 10:17:58,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #94#return; {3831#true} is VALID [2022-04-27 10:17:58,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret15 := main(); {3831#true} is VALID [2022-04-27 10:17:58,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {3839#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {3839#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {3839#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {3839#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {3839#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {3839#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3839#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:17:58,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {3839#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {3837#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:58,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {3837#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3840#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-27 10:17:58,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {3840#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {3901#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-27 10:17:58,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {3901#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3842#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-27 10:17:58,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {3842#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3843#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-27 10:17:58,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {3843#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3844#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:58,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {3844#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3845#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-27 10:17:58,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {3845#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:58,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {3920#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) |main_#t~short10| (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:58,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {3920#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) |main_#t~short10| (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:58,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:17:58,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {3846#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:58,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:58,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:17:58,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {3847#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {3848#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-27 10:17:58,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3849#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:17:58,792 INFO L272 TraceCheckUtils]: 29: Hoare triple {3849#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:58,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {3945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:58,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {3949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3832#false} is VALID [2022-04-27 10:17:58,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-27 10:17:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:17:58,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:59,442 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-04-27 10:17:59,499 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-27 10:17:59,499 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 707 treesize of output 673 [2022-04-27 10:18:01,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-27 10:18:01,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {3949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3832#false} is VALID [2022-04-27 10:18:01,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {3945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:01,111 INFO L272 TraceCheckUtils]: 29: Hoare triple {3849#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:01,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {3968#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {3849#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:18:01,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {3972#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {3968#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-27 10:18:01,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {3972#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3972#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:18:01,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {3972#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3972#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:18:01,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {3982#(forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {3972#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:18:01,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {3982#(forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3982#(forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:01,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {3989#(or (not |main_#t~short10|) (forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4)))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {3982#(forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:01,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {3993#(or (not (<= 0 main_~i~0)) (forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4)))))} #t~short10 := ~i~0 >= 0; {3989#(or (not |main_#t~short10|) (forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-27 10:18:01,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#(or (not (<= 1 main_~j~0)) (forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {3993#(or (not (<= 0 main_~i~0)) (forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-27 10:18:01,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {4001#(or (forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) (+ |main_~#v~0.offset| 4)))) (not (<= 0 main_~j~0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3997#(or (not (<= 1 main_~j~0)) (forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)) v_ArrVal_127) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-27 10:18:01,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {4005#(or (not (<= 0 main_~j~0)) (forall ((v_ArrVal_125 Int) (v_ArrVal_127 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_125) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_125) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_125)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4001#(or (forall ((v_ArrVal_127 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) (+ |main_~#v~0.offset| 4)))) (not (<= 0 main_~j~0)))} is VALID [2022-04-27 10:18:01,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {4009#(or (not (<= 0 main_~j~0)) (forall ((v_ArrVal_125 Int) (v_ArrVal_127 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_125) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_125) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_125)))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4005#(or (not (<= 0 main_~j~0)) (forall ((v_ArrVal_125 Int) (v_ArrVal_127 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_125) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_125) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_125)))))} is VALID [2022-04-27 10:18:01,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {4013#(or (not (<= 0 main_~j~0)) (and (not (= (* main_~j~0 4) 0)) (= 0 (* main_~i~0 4))) (not |main_#t~short10|))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4009#(or (not (<= 0 main_~j~0)) (forall ((v_ArrVal_125 Int) (v_ArrVal_127 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_125) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) |main_~#v~0.offset|) (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_125) (+ |main_~#v~0.offset| (* main_~j~0 4) 4) v_ArrVal_127) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_125)))) |main_#t~short10|)} is VALID [2022-04-27 10:18:01,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {4017#(or (not (<= 0 main_~j~0)) (not (<= 0 main_~i~0)) (and (not (= (* main_~j~0 4) 0)) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {4013#(or (not (<= 0 main_~j~0)) (and (not (= (* main_~j~0 4) 0)) (= 0 (* main_~i~0 4))) (not |main_#t~short10|))} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {4021#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4017#(or (not (<= 0 main_~j~0)) (not (<= 0 main_~i~0)) (and (not (= (* main_~j~0 4) 0)) (= 0 (* main_~i~0 4))))} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {3831#true} ~j~0 := 1; {4021#(<= main_~j~0 1)} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {3831#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {3831#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {3831#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {3831#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {3831#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {3831#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {3831#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret15 := main(); {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #94#return; {3831#true} is VALID [2022-04-27 10:18:01,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-27 10:18:01,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#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); {3831#true} is VALID [2022-04-27 10:18:01,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3831#true} is VALID [2022-04-27 10:18:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:18:01,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194332796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:18:01,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:18:01,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 35 [2022-04-27 10:18:01,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372693826] [2022-04-27 10:18:01,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:18:01,124 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 10:18:01,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:01,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:01,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:01,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 10:18:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:01,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 10:18:01,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 10:18:01,175 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:40,240 WARN L232 SmtUtils]: Spent 12.21s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:18:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:44,646 INFO L93 Difference]: Finished difference Result 213 states and 276 transitions. [2022-04-27 10:18:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 10:18:44,646 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 10:18:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 175 transitions. [2022-04-27 10:18:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 175 transitions. [2022-04-27 10:18:44,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 175 transitions. [2022-04-27 10:18:44,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:44,830 INFO L225 Difference]: With dead ends: 213 [2022-04-27 10:18:44,830 INFO L226 Difference]: Without dead ends: 170 [2022-04-27 10:18:44,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 53 SyntacticMatches, 13 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=684, Invalid=4715, Unknown=3, NotChecked=0, Total=5402 [2022-04-27 10:18:44,832 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 194 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 431 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:44,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 124 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 631 Invalid, 0 Unknown, 431 Unchecked, 0.7s Time] [2022-04-27 10:18:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-27 10:18:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 117. [2022-04-27 10:18:44,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:44,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 117 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 110 states have internal predecessors, (138), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:44,997 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 117 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 110 states have internal predecessors, (138), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:44,997 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 117 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 110 states have internal predecessors, (138), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:45,000 INFO L93 Difference]: Finished difference Result 170 states and 219 transitions. [2022-04-27 10:18:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-27 10:18:45,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:45,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:45,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 110 states have internal predecessors, (138), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 170 states. [2022-04-27 10:18:45,001 INFO L87 Difference]: Start difference. First operand has 117 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 110 states have internal predecessors, (138), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 170 states. [2022-04-27 10:18:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:45,004 INFO L93 Difference]: Finished difference Result 170 states and 219 transitions. [2022-04-27 10:18:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-27 10:18:45,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:45,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:45,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:45,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 110 states have internal predecessors, (138), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2022-04-27 10:18:45,007 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 33 [2022-04-27 10:18:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:45,007 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2022-04-27 10:18:45,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2022-04-27 10:18:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 10:18:45,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:45,008 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:45,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 10:18:45,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:45,221 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:45,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1357831320, now seen corresponding path program 2 times [2022-04-27 10:18:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:45,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520487914] [2022-04-27 10:18:45,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:45,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:45,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:45,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {4926#true} is VALID [2022-04-27 10:18:45,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {4926#true} assume true; {4926#true} is VALID [2022-04-27 10:18:45,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4926#true} {4926#true} #94#return; {4926#true} is VALID [2022-04-27 10:18:45,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {4926#true} call ULTIMATE.init(); {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {4926#true} assume true; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4926#true} {4926#true} #94#return; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {4926#true} call #t~ret15 := main(); {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {4926#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {4926#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {4926#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {4926#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {4926#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {4926#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {4926#true} ~j~0 := 1; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {4926#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {4926#true} #t~short10 := ~i~0 >= 0; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {4926#true} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {4926#true} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {4926#true} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {4926#true} ~i~0 := ~i~0 - 1; {4926#true} is VALID [2022-04-27 10:18:45,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {4926#true} #t~short10 := ~i~0 >= 0; {4926#true} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {4926#true} assume !#t~short10; {4931#(not |main_#t~short10|)} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {4931#(not |main_#t~short10|)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {4927#false} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {4927#false} ~i~0 := ~i~0 - 1; {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {4927#false} #t~short10 := ~i~0 >= 0; {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {4927#false} assume !#t~short10; {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {4927#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {4927#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {4927#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {4927#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {4927#false} ~k~0 := 1; {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {4927#false} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L272 TraceCheckUtils]: 31: Hoare triple {4927#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {4927#false} ~cond := #in~cond; {4927#false} is VALID [2022-04-27 10:18:45,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {4927#false} assume 0 == ~cond; {4927#false} is VALID [2022-04-27 10:18:45,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {4927#false} assume !false; {4927#false} is VALID [2022-04-27 10:18:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 10:18:45,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:45,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520487914] [2022-04-27 10:18:45,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520487914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:18:45,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:18:45,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:18:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103306027] [2022-04-27 10:18:45,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:18:45,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 10:18:45,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:45,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:45,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:18:45,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:45,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:18:45,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:18:45,289 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:45,471 INFO L93 Difference]: Finished difference Result 185 states and 233 transitions. [2022-04-27 10:18:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:18:45,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 10:18:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-27 10:18:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-27 10:18:45,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-27 10:18:45,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:45,512 INFO L225 Difference]: With dead ends: 185 [2022-04-27 10:18:45,512 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 10:18:45,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:18:45,513 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:45,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 39 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:18:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 10:18:45,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-27 10:18:45,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:45,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 72 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,591 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 72 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,591 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 72 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:45,592 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 10:18:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 10:18:45,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:45,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:45,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 72 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-04-27 10:18:45,593 INFO L87 Difference]: Start difference. First operand has 79 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 72 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-04-27 10:18:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:45,594 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 10:18:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 10:18:45,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:45,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:45,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:45,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:45,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 72 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-27 10:18:45,596 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 35 [2022-04-27 10:18:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:45,596 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-27 10:18:45,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 10:18:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 10:18:45,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:45,596 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:45,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 10:18:45,597 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash 925785056, now seen corresponding path program 1 times [2022-04-27 10:18:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:45,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609573895] [2022-04-27 10:18:45,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:45,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:45,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:45,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {5464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {5445#true} is VALID [2022-04-27 10:18:45,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {5445#true} assume true; {5445#true} is VALID [2022-04-27 10:18:45,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5445#true} {5445#true} #94#return; {5445#true} is VALID [2022-04-27 10:18:45,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {5445#true} call ULTIMATE.init(); {5464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:45,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {5464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {5445#true} is VALID [2022-04-27 10:18:45,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {5445#true} assume true; {5445#true} is VALID [2022-04-27 10:18:45,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5445#true} {5445#true} #94#return; {5445#true} is VALID [2022-04-27 10:18:45,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {5445#true} call #t~ret15 := main(); {5445#true} is VALID [2022-04-27 10:18:45,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {5445#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5450#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:18:45,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {5450#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5450#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:18:45,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {5450#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:45,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:45,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:45,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {5452#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:45,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {5452#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:45,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {5452#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:45,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {5452#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:45,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:45,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:45,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:45,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:45,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:45,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {5451#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5453#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} is VALID [2022-04-27 10:18:45,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {5453#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:45,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} #t~short10 := ~i~0 >= 0; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:45,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:45,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:45,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:45,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} ~i~0 := ~i~0 - 1; {5455#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2022-04-27 10:18:45,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {5455#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} #t~short10 := ~i~0 >= 0; {5456#(and (= |main_~#v~0.offset| 0) (or (and (<= main_~i~0 0) (<= 0 main_~i~0)) (not |main_#t~short10|)))} is VALID [2022-04-27 10:18:45,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {5456#(and (= |main_~#v~0.offset| 0) (or (and (<= main_~i~0 0) (<= 0 main_~i~0)) (not |main_#t~short10|)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5457#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-27 10:18:45,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {5457#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5458#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} is VALID [2022-04-27 10:18:45,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {5458#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:45,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:45,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:45,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {5460#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-27 10:18:45,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {5460#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {5461#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:18:45,952 INFO L272 TraceCheckUtils]: 34: Hoare triple {5461#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5462#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:18:45,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {5462#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5463#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:18:45,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {5463#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5446#false} is VALID [2022-04-27 10:18:45,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {5446#false} assume !false; {5446#false} is VALID [2022-04-27 10:18:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:18:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:45,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609573895] [2022-04-27 10:18:45,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609573895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:45,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924426169] [2022-04-27 10:18:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:45,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:45,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:45,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:18:45,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 10:18:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:46,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 10:18:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:46,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:18:46,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 10:18:46,391 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-04-27 10:18:46,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:18:46,502 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-04-27 10:18:46,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {5445#true} call ULTIMATE.init(); {5445#true} is VALID [2022-04-27 10:18:46,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {5445#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); {5445#true} is VALID [2022-04-27 10:18:46,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {5445#true} assume true; {5445#true} is VALID [2022-04-27 10:18:46,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5445#true} {5445#true} #94#return; {5445#true} is VALID [2022-04-27 10:18:46,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {5445#true} call #t~ret15 := main(); {5445#true} is VALID [2022-04-27 10:18:46,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {5445#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:46,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {5452#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:46,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {5452#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:46,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {5452#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:46,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {5452#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:46,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {5452#(= |main_~#v~0.offset| 0)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:46,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {5452#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:46,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {5452#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5452#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:46,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {5452#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:46,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:46,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:46,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:46,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:46,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:46,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {5507#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5453#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} is VALID [2022-04-27 10:18:46,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {5453#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:46,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} #t~short10 := ~i~0 >= 0; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:46,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:46,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:46,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-27 10:18:46,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {5454#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} ~i~0 := ~i~0 - 1; {5455#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2022-04-27 10:18:46,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {5455#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} #t~short10 := ~i~0 >= 0; {5547#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-27 10:18:46,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {5547#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5457#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} is VALID [2022-04-27 10:18:46,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {5457#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (or (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) |main_#t~short10|))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5458#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} is VALID [2022-04-27 10:18:46,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {5458#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) main_~key~0) (<= 0 main_~i~0))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:46,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:46,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:46,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {5459#(and (= |main_~#v~0.offset| 0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {5460#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-27 10:18:46,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {5460#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {5461#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:18:46,593 INFO L272 TraceCheckUtils]: 34: Hoare triple {5461#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:46,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {5572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:46,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {5576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5446#false} is VALID [2022-04-27 10:18:46,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {5446#false} assume !false; {5446#false} is VALID [2022-04-27 10:18:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:18:46,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:18:48,928 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-04-27 10:18:48,963 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-27 10:18:48,963 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-04-27 10:18:49,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {5446#false} assume !false; {5446#false} is VALID [2022-04-27 10:18:49,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {5576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5446#false} is VALID [2022-04-27 10:18:49,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {5572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:49,236 INFO L272 TraceCheckUtils]: 34: Hoare triple {5461#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:49,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {5595#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {5461#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:18:49,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {5599#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} ~k~0 := 1; {5595#(<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4))))} is VALID [2022-04-27 10:18:49,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {5599#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5599#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:18:49,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {5599#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5599#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:18:49,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {5609#(forall ((v_ArrVal_169 Int)) (or (not (<= main_~key~0 v_ArrVal_169)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_169) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_169) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5599#(<= (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))} is VALID [2022-04-27 10:18:49,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {5613#(or (forall ((v_ArrVal_169 Int)) (or (not (<= main_~key~0 v_ArrVal_169)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_169) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_169) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5609#(forall ((v_ArrVal_169 Int)) (or (not (<= main_~key~0 v_ArrVal_169)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_169) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_169) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-27 10:18:49,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {5617#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5613#(or (forall ((v_ArrVal_169 Int)) (or (not (<= main_~key~0 v_ArrVal_169)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_169) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_169) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-27 10:18:49,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {5621#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5617#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-27 10:18:49,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {5625#(<= main_~i~0 1)} ~i~0 := ~i~0 - 1; {5621#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-27 10:18:49,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {5625#(<= main_~i~0 1)} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {5625#(<= main_~i~0 1)} is VALID [2022-04-27 10:18:49,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {5625#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {5625#(<= main_~i~0 1)} is VALID [2022-04-27 10:18:49,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {5625#(<= main_~i~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5625#(<= main_~i~0 1)} is VALID [2022-04-27 10:18:49,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {5625#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {5625#(<= main_~i~0 1)} is VALID [2022-04-27 10:18:49,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {5641#(<= main_~j~0 2)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5625#(<= main_~i~0 1)} is VALID [2022-04-27 10:18:49,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {5645#(<= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5641#(<= main_~j~0 2)} is VALID [2022-04-27 10:18:49,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {5645#(<= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5645#(<= main_~j~0 1)} is VALID [2022-04-27 10:18:49,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {5645#(<= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5645#(<= main_~j~0 1)} is VALID [2022-04-27 10:18:49,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {5645#(<= main_~j~0 1)} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {5645#(<= main_~j~0 1)} is VALID [2022-04-27 10:18:49,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {5645#(<= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {5645#(<= main_~j~0 1)} is VALID [2022-04-27 10:18:49,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {5645#(<= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {5645#(<= main_~j~0 1)} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {5445#true} ~j~0 := 1; {5645#(<= main_~j~0 1)} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {5445#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {5445#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {5445#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {5445#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {5445#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {5445#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {5445#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {5445#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {5445#true} call #t~ret15 := main(); {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5445#true} {5445#true} #94#return; {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {5445#true} assume true; {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {5445#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); {5445#true} is VALID [2022-04-27 10:18:49,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {5445#true} call ULTIMATE.init(); {5445#true} is VALID [2022-04-27 10:18:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:18:49,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924426169] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:18:49,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:18:49,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 30 [2022-04-27 10:18:49,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200184258] [2022-04-27 10:18:49,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:18:49,246 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 10:18:49,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:18:49,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:49,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:49,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 10:18:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:18:49,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 10:18:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=752, Unknown=1, NotChecked=0, Total=870 [2022-04-27 10:18:49,302 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:52,269 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2022-04-27 10:18:52,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-27 10:18:52,270 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 10:18:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 168 transitions. [2022-04-27 10:18:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 168 transitions. [2022-04-27 10:18:52,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 168 transitions. [2022-04-27 10:18:52,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:52,456 INFO L225 Difference]: With dead ends: 183 [2022-04-27 10:18:52,456 INFO L226 Difference]: Without dead ends: 149 [2022-04-27 10:18:52,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=683, Invalid=3222, Unknown=1, NotChecked=0, Total=3906 [2022-04-27 10:18:52,458 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 154 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:52,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 111 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1004 Invalid, 0 Unknown, 96 Unchecked, 1.1s Time] [2022-04-27 10:18:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-27 10:18:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 83. [2022-04-27 10:18:52,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:52,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 83 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:52,528 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 83 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:52,528 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 83 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:52,531 INFO L93 Difference]: Finished difference Result 149 states and 183 transitions. [2022-04-27 10:18:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2022-04-27 10:18:52,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:52,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:52,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 149 states. [2022-04-27 10:18:52,532 INFO L87 Difference]: Start difference. First operand has 83 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 149 states. [2022-04-27 10:18:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:52,534 INFO L93 Difference]: Finished difference Result 149 states and 183 transitions. [2022-04-27 10:18:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2022-04-27 10:18:52,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:52,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:52,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:52,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:18:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2022-04-27 10:18:52,536 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 38 [2022-04-27 10:18:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:52,536 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-04-27 10:18:52,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-04-27 10:18:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 10:18:52,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:52,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:52,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 10:18:52,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 10:18:52,743 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 909842600, now seen corresponding path program 3 times [2022-04-27 10:18:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099587420] [2022-04-27 10:18:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:53,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:53,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {6456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {6431#true} is VALID [2022-04-27 10:18:53,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {6431#true} assume true; {6431#true} is VALID [2022-04-27 10:18:53,298 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6431#true} {6431#true} #94#return; {6431#true} is VALID [2022-04-27 10:18:53,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {6431#true} call ULTIMATE.init(); {6456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:53,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {6456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {6431#true} is VALID [2022-04-27 10:18:53,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {6431#true} assume true; {6431#true} is VALID [2022-04-27 10:18:53,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6431#true} {6431#true} #94#return; {6431#true} is VALID [2022-04-27 10:18:53,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {6431#true} call #t~ret15 := main(); {6431#true} is VALID [2022-04-27 10:18:53,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {6431#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {6436#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:18:53,299 INFO L290 TraceCheckUtils]: 6: Hoare triple {6436#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6436#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-27 10:18:53,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {6436#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6437#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:53,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {6437#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6437#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:53,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {6437#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6438#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-27 10:18:53,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {6438#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6438#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-27 10:18:53,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {6438#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6439#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:53,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {6439#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6439#(= |main_~#v~0.offset| 0)} is VALID [2022-04-27 10:18:53,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {6439#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {6437#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:18:53,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {6437#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6440#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (<= (+ main_~i~0 1) 0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-27 10:18:53,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {6440#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (or (<= (+ main_~i~0 1) 0) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {6441#(and (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-27 10:18:53,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {6441#(and (or (not |main_#t~short10|) (and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)))) (= (+ (- 1) main_~j~0) 0))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6442#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-27 10:18:53,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {6442#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (or (not |main_#t~short10|) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))))) (= 0 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {6443#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-27 10:18:53,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {6443#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {6444#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} is VALID [2022-04-27 10:18:53,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {6444#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= 0 (* main_~i~0 4)))} ~i~0 := ~i~0 - 1; {6445#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)))} is VALID [2022-04-27 10:18:53,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {6445#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)))} #t~short10 := ~i~0 >= 0; {6446#(and (= (+ (- 1) main_~j~0) 0) (or (and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) |main_#t~short10|))} is VALID [2022-04-27 10:18:53,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {6446#(and (= (+ (- 1) main_~j~0) 0) (or (and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4)))) |main_#t~short10|))} assume !#t~short10; {6447#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:53,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {6447#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6447#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:53,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {6447#(and (= |main_~#v~0.offset| 0) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (= main_~j~0 1) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6448#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:53,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {6448#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6449#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} is VALID [2022-04-27 10:18:53,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {6449#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6450#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:18:53,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {6450#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {6450#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:18:53,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {6450#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6450#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:18:53,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {6450#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6450#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} is VALID [2022-04-27 10:18:53,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {6450#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= 4 (* main_~i~0 4)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6451#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:53,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {6451#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6451#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:53,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {6451#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6451#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-27 10:18:53,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {6451#(and (= |main_~#v~0.offset| 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} ~k~0 := 1; {6452#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} is VALID [2022-04-27 10:18:53,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {6452#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~k~0) 0) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4) (- 4))) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~k~0 4)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {6453#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:18:53,334 INFO L272 TraceCheckUtils]: 34: Hoare triple {6453#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6454#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:18:53,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {6454#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6455#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:18:53,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {6455#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6432#false} is VALID [2022-04-27 10:18:53,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {6432#false} assume !false; {6432#false} is VALID [2022-04-27 10:18:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:18:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:53,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099587420] [2022-04-27 10:18:53,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099587420] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:53,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994884214] [2022-04-27 10:18:53,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:18:53,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:53,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:53,336 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:18:53,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 10:18:53,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 10:18:53,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:18:53,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 10:18:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:53,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:18:53,575 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-27 10:18:53,575 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-04-27 10:18:53,909 INFO L356 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-04-27 10:18:53,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 30 [2022-04-27 10:18:54,507 INFO L356 Elim1Store]: treesize reduction 76, result has 22.4 percent of original size [2022-04-27 10:18:54,507 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 32 treesize of output 34 [2022-04-27 10:18:54,931 INFO L356 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2022-04-27 10:18:54,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2022-04-27 10:18:55,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {6431#true} call ULTIMATE.init(); {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {6431#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); {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {6431#true} assume true; {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6431#true} {6431#true} #94#return; {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {6431#true} call #t~ret15 := main(); {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {6431#true} ~SIZE~0 := #t~nondet4;havoc #t~nondet4;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.allocOnStack(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));~j~0 := 0; {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {6431#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {6431#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {6431#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {6431#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {6431#true} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);havoc #t~nondet6; {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {6431#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {6431#true} is VALID [2022-04-27 10:18:55,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {6431#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6431#true} is VALID [2022-04-27 10:18:55,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {6431#true} ~j~0 := 1; {6499#(= main_~j~0 1)} is VALID [2022-04-27 10:18:55,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {6499#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6503#(and (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-27 10:18:55,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {6503#(and (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {6503#(and (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} is VALID [2022-04-27 10:18:55,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {6503#(and (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6510#(and (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)))} is VALID [2022-04-27 10:18:55,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {6510#(and (= (+ (- 1) main_~j~0) main_~i~0) (= main_~j~0 1) (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10; {6514#(and (= main_~j~0 1) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= main_~j~0 (+ main_~i~0 1)))} is VALID [2022-04-27 10:18:55,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {6514#(and (= main_~j~0 1) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (= main_~j~0 (+ main_~i~0 1)))} assume ~i~0 < 2;call #t~mem11 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);call write~int(#t~mem11, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4);havoc #t~mem11; {6518#(and (= main_~j~0 1) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= main_~j~0 (+ main_~i~0 1)))} is VALID [2022-04-27 10:18:55,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {6518#(and (= main_~j~0 1) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)))) (= main_~j~0 (+ main_~i~0 1)))} ~i~0 := ~i~0 - 1; {6522#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (= main_~j~0 1) (<= main_~j~0 (+ main_~i~0 2)))} is VALID [2022-04-27 10:18:55,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {6522#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (= main_~j~0 1) (<= main_~j~0 (+ main_~i~0 2)))} #t~short10 := ~i~0 >= 0; {6526#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (= main_~j~0 1) (<= main_~j~0 (+ main_~i~0 2)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-27 10:18:55,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {6526#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (= main_~j~0 1) (<= main_~j~0 (+ main_~i~0 2)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {6530#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (= main_~j~0 1) (< main_~i~0 0) (<= main_~j~0 (+ main_~i~0 2)))} is VALID [2022-04-27 10:18:55,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {6530#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (= main_~j~0 1) (< main_~i~0 0) (<= main_~j~0 (+ main_~i~0 2)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6530#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (= main_~j~0 1) (< main_~i~0 0) (<= main_~j~0 (+ main_~i~0 2)))} is VALID [2022-04-27 10:18:55,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {6530#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4)))) (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4) (- 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (= main_~j~0 1) (< main_~i~0 0) (<= main_~j~0 (+ main_~i~0 2)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6537#(and (= main_~j~0 1) (exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (<= main_~j~0 (+ main_~i~0 2)))))} is VALID [2022-04-27 10:18:55,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {6537#(and (= main_~j~0 1) (exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~j~0 4)))) (<= main_~j~0 (+ main_~i~0 2)))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6541#(and (= main_~j~0 2) (exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))))} is VALID [2022-04-27 10:18:55,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {6541#(and (= main_~j~0 2) (exists ((main_~i~0 Int)) (and (< main_~i~0 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ main_~i~0 1)))))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem8 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~j~0, 4);~key~0 := #t~mem8;havoc #t~mem8;~i~0 := ~j~0 - 1; {6545#(and (= 2 (+ main_~i~0 1)) (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} is VALID [2022-04-27 10:18:55,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {6545#(and (= 2 (+ main_~i~0 1)) (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} #t~short10 := ~i~0 >= 0; {6549#(and (= 2 (+ main_~i~0 1)) |main_#t~short10| (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} is VALID [2022-04-27 10:18:55,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {6549#(and (= 2 (+ main_~i~0 1)) |main_#t~short10| (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} assume #t~short10;call #t~mem9 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~i~0, 4);#t~short10 := #t~mem9 > ~key~0; {6545#(and (= 2 (+ main_~i~0 1)) (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} is VALID [2022-04-27 10:18:55,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {6545#(and (= 2 (+ main_~i~0 1)) (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6545#(and (= 2 (+ main_~i~0 1)) (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} is VALID [2022-04-27 10:18:55,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {6545#(and (= 2 (+ main_~i~0 1)) (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {6559#(exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1))))} is VALID [2022-04-27 10:18:55,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {6559#(exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {6559#(exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1))))} is VALID [2022-04-27 10:18:55,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {6559#(exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {6559#(exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1))))} is VALID [2022-04-27 10:18:55,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {6559#(exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1))))} ~k~0 := 1; {6569#(and (= main_~k~0 1) (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} is VALID [2022-04-27 10:18:55,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {6569#(and (= main_~k~0 1) (exists ((v_main_~i~0_27 Int)) (and (< v_main_~i~0_27 0) (< (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_27 4) 4)) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= 0 (+ v_main_~i~0_27 1)))))} assume !!(~k~0 % 4294967296 < ~SIZE~0 % 4294967296);call #t~mem13 := read~int(~#v~0.base, ~#v~0.offset + 4 * (~k~0 - 1), 4);call #t~mem14 := read~int(~#v~0.base, ~#v~0.offset + 4 * ~k~0, 4); {6573#(< |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-27 10:18:55,130 INFO L272 TraceCheckUtils]: 34: Hoare triple {6573#(< |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:55,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {6577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:55,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {6581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6432#false} is VALID [2022-04-27 10:18:55,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {6432#false} assume !false; {6432#false} is VALID [2022-04-27 10:18:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 10:18:55,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:02,716 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 85 treesize of output 77 [2022-04-27 10:19:02,885 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-04-27 10:19:02,885 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 5391 treesize of output 5197 [2022-04-27 10:19:03,335 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-27 10:19:03,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 10:19:03,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:19:03,551 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:389) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 10:19:03,556 INFO L158 Benchmark]: Toolchain (without parser) took 127728.19ms. Allocated memory was 242.2MB in the beginning and 304.1MB in the end (delta: 61.9MB). Free memory was 212.7MB in the beginning and 201.4MB in the end (delta: 11.3MB). Peak memory consumption was 180.4MB. Max. memory is 8.0GB. [2022-04-27 10:19:03,557 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 242.2MB. Free memory is still 202.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:19:03,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.40ms. Allocated memory is still 242.2MB. Free memory was 212.5MB in the beginning and 214.7MB in the end (delta: -2.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-27 10:19:03,557 INFO L158 Benchmark]: Boogie Preprocessor took 44.38ms. Allocated memory is still 242.2MB. Free memory was 214.7MB in the beginning and 212.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:19:03,557 INFO L158 Benchmark]: RCFGBuilder took 336.62ms. Allocated memory is still 242.2MB. Free memory was 212.6MB in the beginning and 199.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:19:03,557 INFO L158 Benchmark]: TraceAbstraction took 127123.23ms. Allocated memory was 242.2MB in the beginning and 304.1MB in the end (delta: 61.9MB). Free memory was 199.2MB in the beginning and 201.4MB in the end (delta: -2.2MB). Peak memory consumption was 167.4MB. Max. memory is 8.0GB. [2022-04-27 10:19:03,558 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 242.2MB. Free memory is still 202.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.40ms. Allocated memory is still 242.2MB. Free memory was 212.5MB in the beginning and 214.7MB in the end (delta: -2.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.38ms. Allocated memory is still 242.2MB. Free memory was 214.7MB in the beginning and 212.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 336.62ms. Allocated memory is still 242.2MB. Free memory was 212.6MB in the beginning and 199.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 127123.23ms. Allocated memory was 242.2MB in the beginning and 304.1MB in the end (delta: 61.9MB). Free memory was 199.2MB in the beginning and 201.4MB in the end (delta: -2.2MB). Peak memory consumption was 167.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 10:19:03,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...