/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:41:29,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:41:29,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:41:29,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:41:29,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:41:29,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:41:29,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:41:29,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:41:29,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:41:29,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:41:29,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:41:29,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:41:29,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:41:29,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:41:29,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:41:29,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:41:29,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:41:29,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:41:29,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:41:29,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:41:29,572 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:41:29,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:41:29,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:41:29,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:41:29,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:41:29,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:41:29,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:41:29,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:41:29,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:41:29,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:41:29,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:41:29,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:41:29,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:41:29,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:41:29,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:41:29,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:41:29,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:41:29,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:41:29,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:41:29,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:41:29,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:41:29,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:41:29,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:41:29,599 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:41:29,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:41:29,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:41:29,601 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:41:29,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:41:29,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:41:29,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:41:29,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:41:29,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:41:29,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:41:29,603 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:41:29,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:41:29,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:41:29,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:41:29,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:41:29,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:41:29,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:41:29,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:41:29,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:29,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:41:29,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:41:29,604 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:41:29,604 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:41:29,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:41:29,604 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:41:29,604 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 02:41:29,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:41:29,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:41:29,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:41:29,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:41:29,836 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:41:29,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2.c [2022-04-28 02:41:29,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1723037c6/b124ee53ed104d9995b088d125f2172c/FLAGf41e2986d [2022-04-28 02:41:30,216 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:41:30,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2022-04-28 02:41:30,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1723037c6/b124ee53ed104d9995b088d125f2172c/FLAGf41e2986d [2022-04-28 02:41:30,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1723037c6/b124ee53ed104d9995b088d125f2172c [2022-04-28 02:41:30,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:41:30,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:41:30,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:30,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:41:30,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:41:30,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db9d892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30, skipping insertion in model container [2022-04-28 02:41:30,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:41:30,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:41:30,814 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-2.c[328,341] [2022-04-28 02:41:30,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:30,858 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:41:30,869 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-2.c[328,341] [2022-04-28 02:41:30,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:30,909 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:41:30,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30 WrapperNode [2022-04-28 02:41:30,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:30,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:41:30,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:41:30,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:41:30,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:41:30,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:41:30,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:41:30,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:41:30,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (1/1) ... [2022-04-28 02:41:30,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:30,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:30,996 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-28 02:41:31,000 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-28 02:41:31,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:41:31,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:41:31,035 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:41:31,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:41:31,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:41:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:41:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:41:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:41:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:41:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:41:31,088 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:41:31,090 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:41:31,248 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:41:31,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:41:31,254 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 02:41:31,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:31 BoogieIcfgContainer [2022-04-28 02:41:31,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:41:31,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:41:31,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:41:31,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:41:31,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:30" (1/3) ... [2022-04-28 02:41:31,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653b9bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:31, skipping insertion in model container [2022-04-28 02:41:31,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:30" (2/3) ... [2022-04-28 02:41:31,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653b9bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:31, skipping insertion in model container [2022-04-28 02:41:31,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:31" (3/3) ... [2022-04-28 02:41:31,262 INFO L111 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2022-04-28 02:41:31,274 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:41:31,274 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:41:31,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:41:31,329 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@1d6bbf30, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39982fd2 [2022-04-28 02:41:31,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:41:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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-28 02:41:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:41:31,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:31,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:31,343 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549692, now seen corresponding path program 1 times [2022-04-28 02:41:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:31,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1321525193] [2022-04-28 02:41:31,362 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:31,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1914549692, now seen corresponding path program 2 times [2022-04-28 02:41:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:31,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536636443] [2022-04-28 02:41:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:31,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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); {34#true} is VALID [2022-04-28 02:41:31,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 02:41:31,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-28 02:41:31,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:31,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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); {34#true} is VALID [2022-04-28 02:41:31,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 02:41:31,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-28 02:41:31,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret15 := main(); {34#true} is VALID [2022-04-28 02:41:31,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#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; {34#true} is VALID [2022-04-28 02:41:31,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {34#true} is VALID [2022-04-28 02:41:31,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~j~0 := 1; {34#true} is VALID [2022-04-28 02:41:31,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 02:41:31,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~k~0 := 1; {35#false} is VALID [2022-04-28 02:41:31,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#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); {35#false} is VALID [2022-04-28 02:41:31,542 INFO L272 TraceCheckUtils]: 11: Hoare triple {35#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {35#false} is VALID [2022-04-28 02:41:31,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 02:41:31,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 02:41:31,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 02:41:31,543 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-28 02:41:31,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:31,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536636443] [2022-04-28 02:41:31,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536636443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:31,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:31,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:31,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:31,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1321525193] [2022-04-28 02:41:31,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1321525193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:31,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:31,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:41:31,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987813599] [2022-04-28 02:41:31,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-28 02:41:31,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:31,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-28 02:41:31,577 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-28 02:41:31,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:41:31,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:31,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:41:31,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:41:31,596 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-28 02:41:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:31,684 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 02:41:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:41:31,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-28 02:41:31,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-28 02:41:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-28 02:41:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-28 02:41:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-28 02:41:31,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-28 02:41:31,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:31,822 INFO L225 Difference]: With dead ends: 54 [2022-04-28 02:41:31,823 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:41:31,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:41:31,833 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:31,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:41:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 02:41:31,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:31,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-28 02:41:31,877 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-28 02:41:31,878 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-28 02:41:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:31,880 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 02:41:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 02:41:31,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:31,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:31,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 26 states. [2022-04-28 02:41:31,882 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 26 states. [2022-04-28 02:41:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:31,884 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 02:41:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 02:41:31,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:31,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:31,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:31,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-28 02:41:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-28 02:41:31,891 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2022-04-28 02:41:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:31,893 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-28 02:41:31,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-28 02:41:31,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-28 02:41:31,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 02:41:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:41:31,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:31,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:31,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:41:31,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:31,937 INFO L85 PathProgramCache]: Analyzing trace with hash 314290466, now seen corresponding path program 1 times [2022-04-28 02:41:31,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:31,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905028713] [2022-04-28 02:41:31,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash 314290466, now seen corresponding path program 2 times [2022-04-28 02:41:31,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:31,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490643384] [2022-04-28 02:41:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:32,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:32,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#(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); {254#true} is VALID [2022-04-28 02:41:32,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-28 02:41:32,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #87#return; {254#true} is VALID [2022-04-28 02:41:32,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:32,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#(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); {254#true} is VALID [2022-04-28 02:41:32,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-28 02:41:32,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {254#true} #87#return; {254#true} is VALID [2022-04-28 02:41:32,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {254#true} call #t~ret15 := main(); {254#true} is VALID [2022-04-28 02:41:32,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {254#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; {259#(= main_~j~0 0)} is VALID [2022-04-28 02:41:32,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:32,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~j~0 := 1; {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:32,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:32,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#(<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296))} ~k~0 := 1; {261#(and (<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 4294967296)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 02:41:32,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {261#(and (<= main_~SIZE~0 (* (div main_~SIZE~0 4294967296) 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); {255#false} is VALID [2022-04-28 02:41:32,174 INFO L272 TraceCheckUtils]: 11: Hoare triple {255#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {255#false} is VALID [2022-04-28 02:41:32,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#false} ~cond := #in~cond; {255#false} is VALID [2022-04-28 02:41:32,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#false} assume 0 == ~cond; {255#false} is VALID [2022-04-28 02:41:32,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-04-28 02:41:32,175 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-28 02:41:32,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:32,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490643384] [2022-04-28 02:41:32,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490643384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:32,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:32,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:41:32,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:32,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905028713] [2022-04-28 02:41:32,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905028713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:32,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:32,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:41:32,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126666547] [2022-04-28 02:41:32,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:32,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-28 02:41:32,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:32,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-28 02:41:32,197 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-28 02:41:32,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:41:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:32,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:41:32,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:41:32,199 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-28 02:41:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:32,413 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-28 02:41:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:41:32,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-28 02:41:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-28 02:41:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 02:41:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-28 02:41:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 02:41:32,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-28 02:41:32,470 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-28 02:41:32,472 INFO L225 Difference]: With dead ends: 49 [2022-04-28 02:41:32,472 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 02:41:32,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:41:32,473 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:32,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 02:41:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 02:41:32,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:32,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-28 02:41:32,479 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-28 02:41:32,480 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-28 02:41:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:32,481 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 02:41:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 02:41:32,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:32,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:32,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 28 states. [2022-04-28 02:41:32,482 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 28 states. [2022-04-28 02:41:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:32,484 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 02:41:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 02:41:32,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:32,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:32,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:32,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-28 02:41:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 02:41:32,486 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2022-04-28 02:41:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:32,486 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 02:41:32,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-28 02:41:32,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 02:41:32,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 02:41:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 02:41:32,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:32,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:32,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:41:32,518 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:32,519 INFO L85 PathProgramCache]: Analyzing trace with hash 408725728, now seen corresponding path program 1 times [2022-04-28 02:41:32,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:32,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709683543] [2022-04-28 02:41:32,535 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:32,536 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:32,536 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 408725728, now seen corresponding path program 2 times [2022-04-28 02:41:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:32,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168284087] [2022-04-28 02:41:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:32,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:32,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:32,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {491#(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); {481#true} is VALID [2022-04-28 02:41:32,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-28 02:41:32,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-28 02:41:32,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:32,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#(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); {481#true} is VALID [2022-04-28 02:41:32,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-28 02:41:32,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-28 02:41:32,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret15 := main(); {481#true} is VALID [2022-04-28 02:41:32,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#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; {486#(= main_~j~0 0)} is VALID [2022-04-28 02:41:32,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(= 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; {487#(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-28 02:41:32,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {487#(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; {488#(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-28 02:41:32,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(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); {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:32,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~j~0 := 1; {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:32,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:32,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {490#(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-28 02:41:32,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#(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); {482#false} is VALID [2022-04-28 02:41:32,686 INFO L272 TraceCheckUtils]: 13: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {482#false} is VALID [2022-04-28 02:41:32,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-28 02:41:32,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-28 02:41:32,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-28 02:41:32,687 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-28 02:41:32,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:32,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168284087] [2022-04-28 02:41:32,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168284087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:32,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003442646] [2022-04-28 02:41:32,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:32,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:32,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:32,689 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-28 02:41:32,730 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-28 02:41:32,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 02:41:32,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:32,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 02:41:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:32,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:33,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2022-04-28 02:41:33,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#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); {481#true} is VALID [2022-04-28 02:41:33,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2022-04-28 02:41:33,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #87#return; {481#true} is VALID [2022-04-28 02:41:33,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret15 := main(); {481#true} is VALID [2022-04-28 02:41:33,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {481#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; {481#true} is VALID [2022-04-28 02:41:33,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#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; {481#true} is VALID [2022-04-28 02:41:33,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {481#true} is VALID [2022-04-28 02:41:33,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {481#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {481#true} is VALID [2022-04-28 02:41:33,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {481#true} ~j~0 := 1; {522#(= main_~j~0 1)} is VALID [2022-04-28 02:41:33,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {522#(= main_~j~0 1)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} is VALID [2022-04-28 02:41:33,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {489#(<= 0 (div (+ (* (div main_~SIZE~0 4294967296) 4294967296) (* (- 1) main_~SIZE~0) 1) 4294967296))} ~k~0 := 1; {490#(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-28 02:41:33,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {490#(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); {482#false} is VALID [2022-04-28 02:41:33,218 INFO L272 TraceCheckUtils]: 13: Hoare triple {482#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {482#false} is VALID [2022-04-28 02:41:33,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} ~cond := #in~cond; {482#false} is VALID [2022-04-28 02:41:33,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {482#false} assume 0 == ~cond; {482#false} is VALID [2022-04-28 02:41:33,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-04-28 02:41:33,220 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-28 02:41:33,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 02:41:33,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003442646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:33,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 02:41:33,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-28 02:41:33,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:33,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709683543] [2022-04-28 02:41:33,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709683543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:33,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:33,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:41:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279441300] [2022-04-28 02:41:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:33,222 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-28 02:41:33,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:33,223 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-28 02:41:33,236 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-28 02:41:33,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:41:33,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:33,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:41:33,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:41:33,238 INFO L87 Difference]: Start difference. First operand 27 states and 31 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-28 02:41:33,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:33,339 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-28 02:41:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:41:33,339 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-28 02:41:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:33,339 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-28 02:41:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 02:41:33,342 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-28 02:41:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 02:41:33,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-28 02:41:33,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:33,379 INFO L225 Difference]: With dead ends: 45 [2022-04-28 02:41:33,380 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 02:41:33,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-28 02:41:33,383 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 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-28 02:41:33,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 02:41:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-04-28 02:41:33,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:33,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-28 02:41:33,395 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-28 02:41:33,395 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-28 02:41:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:33,397 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-28 02:41:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-28 02:41:33,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:33,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:33,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 33 states. [2022-04-28 02:41:33,398 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 33 states. [2022-04-28 02:41:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:33,412 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-28 02:41:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-28 02:41:33,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:33,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:33,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:33,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-28 02:41:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-28 02:41:33,414 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2022-04-28 02:41:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:33,414 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-28 02:41:33,414 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-28 02:41:33,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-28 02:41:33,443 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-28 02:41:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-28 02:41:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:41:33,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:33,444 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-28 02:41:33,476 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-28 02:41:33,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:33,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:33,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash -924605581, now seen corresponding path program 1 times [2022-04-28 02:41:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:33,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [698214583] [2022-04-28 02:41:33,689 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:33,689 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:33,689 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash -924605581, now seen corresponding path program 2 times [2022-04-28 02:41:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:33,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837535077] [2022-04-28 02:41:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:33,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:33,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#(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); {759#true} is VALID [2022-04-28 02:41:33,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-28 02:41:33,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-28 02:41:33,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:33,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#(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); {759#true} is VALID [2022-04-28 02:41:33,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-28 02:41:33,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-28 02:41:33,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {759#true} call #t~ret15 := main(); {759#true} is VALID [2022-04-28 02:41:33,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {759#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; {764#(= main_~j~0 0)} is VALID [2022-04-28 02:41:33,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {764#(= 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; {764#(= main_~j~0 0)} is VALID [2022-04-28 02:41:33,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {764#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {765#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:33,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {765#(and (not (<= (+ (div main_~j~0 4294967296) 1) 0)) (<= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:33,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {767#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 02:41:33,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {767#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~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; {760#false} is VALID [2022-04-28 02:41:33,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#false} #t~short10 := ~i~0 >= 0; {760#false} is VALID [2022-04-28 02:41:33,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#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; {760#false} is VALID [2022-04-28 02:41:33,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {760#false} is VALID [2022-04-28 02:41:33,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {760#false} is VALID [2022-04-28 02:41:33,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {760#false} is VALID [2022-04-28 02:41:33,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {760#false} is VALID [2022-04-28 02:41:33,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#false} ~k~0 := 1; {760#false} is VALID [2022-04-28 02:41:33,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {760#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); {760#false} is VALID [2022-04-28 02:41:33,830 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {760#false} is VALID [2022-04-28 02:41:33,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {760#false} ~cond := #in~cond; {760#false} is VALID [2022-04-28 02:41:33,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {760#false} assume 0 == ~cond; {760#false} is VALID [2022-04-28 02:41:33,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#false} assume !false; {760#false} is VALID [2022-04-28 02:41:33,831 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-28 02:41:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:33,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837535077] [2022-04-28 02:41:33,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837535077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:33,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521794099] [2022-04-28 02:41:33,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:33,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:33,833 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-28 02:41:33,872 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-28 02:41:33,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:33,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:33,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:41:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:33,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:34,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {759#true} is VALID [2022-04-28 02:41:34,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#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); {759#true} is VALID [2022-04-28 02:41:34,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-28 02:41:34,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-28 02:41:34,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {759#true} call #t~ret15 := main(); {759#true} is VALID [2022-04-28 02:41:34,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {759#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; {764#(= main_~j~0 0)} is VALID [2022-04-28 02:41:34,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {764#(= 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; {764#(= main_~j~0 0)} is VALID [2022-04-28 02:41:34,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {764#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {793#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:41:34,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= (+ (- 1) main_~j~0) 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {766#(<= main_~SIZE~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; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(<= main_~SIZE~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; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {824#(and (= main_~k~0 1) (<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 02:41:34,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {824#(and (= main_~k~0 1) (<= main_~SIZE~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); {760#false} is VALID [2022-04-28 02:41:34,250 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {760#false} is VALID [2022-04-28 02:41:34,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {760#false} ~cond := #in~cond; {760#false} is VALID [2022-04-28 02:41:34,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {760#false} assume 0 == ~cond; {760#false} is VALID [2022-04-28 02:41:34,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#false} assume !false; {760#false} is VALID [2022-04-28 02:41:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:41:34,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:34,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {760#false} assume !false; {760#false} is VALID [2022-04-28 02:41:34,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {760#false} assume 0 == ~cond; {760#false} is VALID [2022-04-28 02:41:34,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {760#false} ~cond := #in~cond; {760#false} is VALID [2022-04-28 02:41:34,606 INFO L272 TraceCheckUtils]: 19: Hoare triple {760#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {760#false} is VALID [2022-04-28 02:41:34,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {852#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 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); {760#false} is VALID [2022-04-28 02:41:34,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~k~0 := 1; {852#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:41:34,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(<= main_~SIZE~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; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} #t~short10 := ~i~0 >= 0; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {766#(<= main_~SIZE~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; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} ~j~0 := 1; {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {766#(<= main_~SIZE~0 (+ (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:34,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {883#(<= 0 (div (+ (* (- 1) (mod main_~j~0 4294967296)) 1) 4294967296))} is VALID [2022-04-28 02:41:34,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 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; {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-28 02:41:34,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {759#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; {887#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 1) 4294967296))} is VALID [2022-04-28 02:41:34,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {759#true} call #t~ret15 := main(); {759#true} is VALID [2022-04-28 02:41:34,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {759#true} {759#true} #87#return; {759#true} is VALID [2022-04-28 02:41:34,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {759#true} assume true; {759#true} is VALID [2022-04-28 02:41:34,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {759#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); {759#true} is VALID [2022-04-28 02:41:34,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {759#true} call ULTIMATE.init(); {759#true} is VALID [2022-04-28 02:41:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:41:34,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521794099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:34,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:34,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 02:41:34,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:34,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [698214583] [2022-04-28 02:41:34,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [698214583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:34,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:34,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:41:34,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766820935] [2022-04-28 02:41:34,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:34,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2022-04-28 02:41:34,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:34,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-28 02:41:34,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:34,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:41:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:34,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:41:34,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:41:34,638 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-28 02:41:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:34,874 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-28 02:41:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:41:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2022-04-28 02:41:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-28 02:41:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 02:41:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-28 02:41:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 02:41:34,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 02:41:34,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:34,926 INFO L225 Difference]: With dead ends: 55 [2022-04-28 02:41:34,926 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 02:41:34,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:41:34,927 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:34,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 41 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 02:41:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-28 02:41:34,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:34,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-28 02:41:34,939 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-28 02:41:34,939 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-28 02:41:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:34,940 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 02:41:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 02:41:34,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:34,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:34,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 36 states. [2022-04-28 02:41:34,941 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 36 states. [2022-04-28 02:41:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:34,943 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 02:41:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-28 02:41:34,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:34,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:34,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:34,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:34,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-28 02:41:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-28 02:41:34,945 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2022-04-28 02:41:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:34,945 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-28 02:41:34,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-28 02:41:34,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-28 02:41:34,979 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-28 02:41:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-28 02:41:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:41:34,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:34,980 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-28 02:41:34,997 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-28 02:41:35,195 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,SelfDestructingSolverStorable3 [2022-04-28 02:41:35,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1080556849, now seen corresponding path program 3 times [2022-04-28 02:41:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:35,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852275213] [2022-04-28 02:41:35,200 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:35,200 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:35,200 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1080556849, now seen corresponding path program 4 times [2022-04-28 02:41:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:35,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727506326] [2022-04-28 02:41:35,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:35,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:35,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(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); {1161#true} is VALID [2022-04-28 02:41:35,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-28 02:41:35,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-28 02:41:35,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:35,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(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); {1161#true} is VALID [2022-04-28 02:41:35,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-28 02:41:35,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-28 02:41:35,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret15 := main(); {1161#true} is VALID [2022-04-28 02:41:35,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#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; {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:35,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {1166#(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; {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:35,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:35,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {1167#(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; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:35,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {1167#(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; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:35,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:35,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {1168#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:35,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#(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; {1169#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 02:41:35,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {1170#(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-28 02:41:35,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {1170#(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; {1171#(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-28 02:41:35,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {1171#(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; {1172#(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-28 02:41:35,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {1172#(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); {1173#(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-28 02:41:35,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {1173#(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; {1174#(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-28 02:41:35,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#(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); {1174#(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-28 02:41:35,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#(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; {1175#(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-28 02:41:35,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#(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); {1176#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:41:35,672 INFO L272 TraceCheckUtils]: 21: Hoare triple {1176#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:41:35,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {1177#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1178#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:41:35,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1162#false} is VALID [2022-04-28 02:41:35,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-28 02:41:35,673 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-28 02:41:35,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:35,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727506326] [2022-04-28 02:41:35,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727506326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:35,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050090490] [2022-04-28 02:41:35,673 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:41:35,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:35,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:35,674 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-28 02:41:35,688 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-28 02:41:35,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:41:35,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:35,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 02:41:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:35,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:36,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:41:36,142 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-28 02:41:36,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:36,262 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-28 02:41:36,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2022-04-28 02:41:36,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#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); {1161#true} is VALID [2022-04-28 02:41:36,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-28 02:41:36,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-28 02:41:36,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret15 := main(); {1161#true} is VALID [2022-04-28 02:41:36,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#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; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:36,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {1168#(= |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; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:36,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1168#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:36,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {1168#(= |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; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:36,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {1168#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:36,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1168#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:36,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {1168#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {1167#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:36,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {1167#(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; {1219#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2022-04-28 02:41:36,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {1219#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0))} #t~short10 := ~i~0 >= 0; {1223#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0) (<= 0 main_~i~0) |main_#t~short10|)} is VALID [2022-04-28 02:41:36,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {1223#(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; {1227#(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-28 02:41:36,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#(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; {1231#(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-28 02:41:36,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(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); {1174#(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-28 02:41:36,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {1174#(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; {1174#(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-28 02:41:36,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#(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); {1174#(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-28 02:41:36,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#(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; {1175#(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-28 02:41:36,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#(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); {1176#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:41:36,339 INFO L272 TraceCheckUtils]: 21: Hoare triple {1176#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:41:36,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:41:36,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1162#false} is VALID [2022-04-28 02:41:36,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-28 02:41:36,340 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-28 02:41:36,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:36,731 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-28 02:41:36,758 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-28 02:41:36,758 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-28 02:41:36,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-28 02:41:36,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1162#false} is VALID [2022-04-28 02:41:36,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:41:36,910 INFO L272 TraceCheckUtils]: 21: Hoare triple {1176#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:41:36,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {1273#(<= (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); {1176#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:41:36,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {1277#(<= (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; {1273#(<= (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-28 02:41:36,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {1277#(<= (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); {1277#(<= (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-28 02:41:36,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {1277#(<= (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; {1277#(<= (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-28 02:41:36,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {1287#(forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1277#(<= (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-28 02:41:36,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {1291#(or (forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41)))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1287#(forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41))))} is VALID [2022-04-28 02:41:36,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {1295#(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; {1291#(or (forall ((v_ArrVal_41 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_41) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_41)))) |main_#t~short10|)} is VALID [2022-04-28 02:41:36,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {1299#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {1295#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:41:36,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {1303#(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; {1299#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:41:36,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {1161#true} ~j~0 := 1; {1303#(or (not (<= 1 main_~j~0)) (= (+ (* main_~j~0 4) (- 4)) 0))} is VALID [2022-04-28 02:41:36,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1161#true} is VALID [2022-04-28 02:41:36,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {1161#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1161#true} is VALID [2022-04-28 02:41:36,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {1161#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; {1161#true} is VALID [2022-04-28 02:41:36,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {1161#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1161#true} is VALID [2022-04-28 02:41:36,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {1161#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; {1161#true} is VALID [2022-04-28 02:41:36,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#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; {1161#true} is VALID [2022-04-28 02:41:36,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret15 := main(); {1161#true} is VALID [2022-04-28 02:41:36,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #87#return; {1161#true} is VALID [2022-04-28 02:41:36,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-28 02:41:36,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#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); {1161#true} is VALID [2022-04-28 02:41:36,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1161#true} is VALID [2022-04-28 02:41:36,916 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-28 02:41:36,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050090490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:36,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:36,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 29 [2022-04-28 02:41:36,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:36,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852275213] [2022-04-28 02:41:36,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852275213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:36,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:36,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 02:41:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347726008] [2022-04-28 02:41:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 25 [2022-04-28 02:41:36,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:36,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 02:41:36,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:36,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 02:41:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 02:41:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2022-04-28 02:41:36,946 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 02:41:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,107 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-28 02:41:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 02:41:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 25 [2022-04-28 02:41:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 02:41:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-28 02:41:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 02:41:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 79 transitions. [2022-04-28 02:41:38,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 79 transitions. [2022-04-28 02:41:38,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:38,187 INFO L225 Difference]: With dead ends: 65 [2022-04-28 02:41:38,187 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 02:41:38,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=337, Invalid=1733, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 02:41:38,188 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:38,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 69 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 02:41:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 02:41:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2022-04-28 02:41:38,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:38,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-28 02:41:38,230 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-28 02:41:38,230 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-28 02:41:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,233 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 02:41:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 02:41:38,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:38,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:38,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 63 states. [2022-04-28 02:41:38,234 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 63 states. [2022-04-28 02:41:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,236 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 02:41:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 02:41:38,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:38,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:38,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:38,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-28 02:41:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-28 02:41:38,238 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 25 [2022-04-28 02:41:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:38,238 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-28 02:41:38,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 02:41:38,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-28 02:41:38,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 02:41:38,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:41:38,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:38,297 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-28 02:41:38,314 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-28 02:41:38,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:38,503 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:38,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1781621427, now seen corresponding path program 1 times [2022-04-28 02:41:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:38,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054340893] [2022-04-28 02:41:38,509 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:38,509 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:38,509 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1781621427, now seen corresponding path program 2 times [2022-04-28 02:41:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:38,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352573326] [2022-04-28 02:41:38,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:38,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:38,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {1728#(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); {1720#true} is VALID [2022-04-28 02:41:38,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-28 02:41:38,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1720#true} {1720#true} #87#return; {1720#true} is VALID [2022-04-28 02:41:38,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {1720#true} call ULTIMATE.init(); {1728#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:38,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#(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); {1720#true} is VALID [2022-04-28 02:41:38,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1720#true} assume true; {1720#true} is VALID [2022-04-28 02:41:38,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1720#true} {1720#true} #87#return; {1720#true} is VALID [2022-04-28 02:41:38,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {1720#true} call #t~ret15 := main(); {1720#true} is VALID [2022-04-28 02:41:38,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {1720#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; {1720#true} is VALID [2022-04-28 02:41:38,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1720#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; {1720#true} is VALID [2022-04-28 02:41:38,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {1720#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1720#true} is VALID [2022-04-28 02:41:38,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {1720#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; {1720#true} is VALID [2022-04-28 02:41:38,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {1720#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1720#true} is VALID [2022-04-28 02:41:38,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {1720#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1720#true} is VALID [2022-04-28 02:41:38,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {1720#true} ~j~0 := 1; {1725#(= (+ (- 1) main_~j~0) 0)} is VALID [2022-04-28 02:41:38,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {1725#(= (+ (- 1) main_~j~0) 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; {1726#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-28 02:41:38,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {1726#(and (<= main_~j~0 (+ main_~i~0 1)) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {1727#(and (= (+ (- 1) main_~j~0) 0) |main_#t~short10|)} is VALID [2022-04-28 02:41:38,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {1727#(and (= (+ (- 1) main_~j~0) 0) |main_#t~short10|)} assume !#t~short10; {1721#false} is VALID [2022-04-28 02:41:38,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {1721#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {1721#false} is VALID [2022-04-28 02:41:38,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {1721#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {1721#false} is VALID [2022-04-28 02:41:38,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {1721#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1721#false} is VALID [2022-04-28 02:41:38,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {1721#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {1721#false} is VALID [2022-04-28 02:41:38,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {1721#false} ~k~0 := 1; {1721#false} is VALID [2022-04-28 02:41:38,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {1721#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); {1721#false} is VALID [2022-04-28 02:41:38,614 INFO L272 TraceCheckUtils]: 21: Hoare triple {1721#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {1721#false} is VALID [2022-04-28 02:41:38,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {1721#false} ~cond := #in~cond; {1721#false} is VALID [2022-04-28 02:41:38,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {1721#false} assume 0 == ~cond; {1721#false} is VALID [2022-04-28 02:41:38,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {1721#false} assume !false; {1721#false} is VALID [2022-04-28 02:41:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 02:41:38,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:38,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352573326] [2022-04-28 02:41:38,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352573326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:38,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:38,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:41:38,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:38,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1054340893] [2022-04-28 02:41:38,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1054340893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:38,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:38,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:41:38,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243577898] [2022-04-28 02:41:38,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:38,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 25 [2022-04-28 02:41:38,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:38,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-28 02:41:38,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:38,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:41:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:38,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:41:38,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:41:38,631 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-28 02:41:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,833 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-28 02:41:38,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:41:38,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 25 [2022-04-28 02:41:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-28 02:41:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-28 02:41:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-28 02:41:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-28 02:41:38,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-28 02:41:38,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:38,888 INFO L225 Difference]: With dead ends: 82 [2022-04-28 02:41:38,888 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 02:41:38,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:41:38,889 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:38,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 30 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:41:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 02:41:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2022-04-28 02:41:38,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:38,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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-28 02:41:38,934 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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-28 02:41:38,934 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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-28 02:41:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,936 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-28 02:41:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-28 02:41:38,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:38,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:38,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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 51 states. [2022-04-28 02:41:38,937 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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 51 states. [2022-04-28 02:41:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,939 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-28 02:41:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-28 02:41:38,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:38,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:38,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:38,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 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-28 02:41:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-28 02:41:38,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2022-04-28 02:41:38,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:38,940 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-28 02:41:38,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-28 02:41:38,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 54 transitions. [2022-04-28 02:41:39,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 02:41:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:41:39,001 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:39,001 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] [2022-04-28 02:41:39,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 02:41:39,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1755898038, now seen corresponding path program 1 times [2022-04-28 02:41:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:39,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1017331292] [2022-04-28 02:41:39,005 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:39,005 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:39,005 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:39,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1755898038, now seen corresponding path program 2 times [2022-04-28 02:41:39,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:39,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807966841] [2022-04-28 02:41:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:39,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:39,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {2114#(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); {2095#true} is VALID [2022-04-28 02:41:39,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-28 02:41:39,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-28 02:41:39,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:39,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {2114#(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); {2095#true} is VALID [2022-04-28 02:41:39,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-28 02:41:39,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-28 02:41:39,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret15 := main(); {2095#true} is VALID [2022-04-28 02:41:39,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#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; {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:39,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {2100#(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; {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:39,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {2100#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:39,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {2101#(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; {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:39,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {2101#(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; {2102#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:39,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {2102#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2102#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:39,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {2102#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {2101#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:39,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {2101#(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; {2103#(and (= |main_~#v~0.offset| 0) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (and (<= (+ main_~i~0 1) 0) (= (+ (- 1) main_~j~0) 0))))} is VALID [2022-04-28 02:41:39,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {2103#(and (= |main_~#v~0.offset| 0) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4)) (and (<= (+ main_~i~0 1) 0) (= (+ (- 1) main_~j~0) 0))))} #t~short10 := ~i~0 >= 0; {2104#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:41:39,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#(and (= |main_~#v~0.offset| 0) (or (not |main_#t~short10|) (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |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; {2105#(and (= |main_~#v~0.offset| 0) (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-28 02:41:39,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {2105#(and (= |main_~#v~0.offset| 0) (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;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;~i~0 := ~i~0 - 1; {2106#(and (= |main_~#v~0.offset| 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))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 02:41:39,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {2106#(and (= |main_~#v~0.offset| 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))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {2107#(and (= |main_~#v~0.offset| 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) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} is VALID [2022-04-28 02:41:39,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {2107#(and (= |main_~#v~0.offset| 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) (and (<= 0 (+ main_~i~0 1)) |main_#t~short10|)))} assume !#t~short10; {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 02:41:39,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 02:41:39,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {2108#(and (= |main_~#v~0.offset| 0) (<= (+ main_~key~0 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (<= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2109#(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-28 02:41:39,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {2109#(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; {2109#(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-28 02:41:39,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {2109#(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); {2109#(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-28 02:41:39,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {2109#(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; {2110#(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-28 02:41:39,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {2110#(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); {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 02:41:39,381 INFO L272 TraceCheckUtils]: 24: Hoare triple {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:41:39,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2113#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:41:39,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {2113#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2096#false} is VALID [2022-04-28 02:41:39,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-28 02:41:39,384 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-28 02:41:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807966841] [2022-04-28 02:41:39,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807966841] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045372873] [2022-04-28 02:41:39,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:39,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:39,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:39,385 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-28 02:41:39,386 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-28 02:41:39,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:39,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:39,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 02:41:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:39,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:39,674 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-28 02:41:39,674 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 28 treesize of output 23 [2022-04-28 02:41:39,961 INFO L356 Elim1Store]: treesize reduction 76, result has 10.6 percent of original size [2022-04-28 02:41:39,961 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 37 treesize of output 28 [2022-04-28 02:41:40,376 INFO L356 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2022-04-28 02:41:40,376 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-28 02:41:40,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2022-04-28 02:41:40,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#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); {2095#true} is VALID [2022-04-28 02:41:40,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-28 02:41:40,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-28 02:41:40,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret15 := main(); {2095#true} is VALID [2022-04-28 02:41:40,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#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; {2095#true} is VALID [2022-04-28 02:41:40,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {2095#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; {2095#true} is VALID [2022-04-28 02:41:40,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-28 02:41:40,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {2095#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; {2095#true} is VALID [2022-04-28 02:41:40,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-28 02:41:40,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {2095#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2095#true} is VALID [2022-04-28 02:41:40,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {2095#true} ~j~0 := 1; {2151#(= main_~j~0 1)} is VALID [2022-04-28 02:41:40,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {2151#(= 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; {2155#(= (+ main_~i~0 1) 1)} is VALID [2022-04-28 02:41:40,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#(= (+ main_~i~0 1) 1)} #t~short10 := ~i~0 >= 0; {2159#(and |main_#t~short10| (= (+ main_~i~0 1) 1))} is VALID [2022-04-28 02:41:40,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {2159#(and |main_#t~short10| (= (+ main_~i~0 1) 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; {2163#(and (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (= main_~i~0 0))} is VALID [2022-04-28 02:41:40,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {2163#(and (or (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4)))) (not |main_#t~short10|)) (= main_~i~0 0))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {2167#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (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))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 02:41:40,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {2167#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (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))) (<= 0 (+ main_~i~0 1)))} #t~short10 := ~i~0 >= 0; {2171#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (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))) (<= 0 (+ main_~i~0 1)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 02:41:40,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {2171#(and (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (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))) (<= 0 (+ main_~i~0 1)) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {2175#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (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))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 02:41:40,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {2175#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (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))) (<= 0 (+ main_~i~0 1)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2175#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (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))) (<= 0 (+ main_~i~0 1)))} is VALID [2022-04-28 02:41:40,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {2175#(and (< main_~i~0 0) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|)) (<= (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))) (<= 0 (+ main_~i~0 1)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2182#(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-28 02:41:40,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {2182#(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))))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2182#(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-28 02:41:40,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {2182#(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); {2182#(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-28 02:41:40,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {2182#(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))))} ~k~0 := 1; {2192#(and (= main_~k~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| 4))) (<= 0 (+ main_~i~0 1)))))} is VALID [2022-04-28 02:41:40,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {2192#(and (= main_~k~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| 4))) (<= 0 (+ main_~i~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); {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 02:41:40,504 INFO L272 TraceCheckUtils]: 24: Hoare triple {2111#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:41:40,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:41:40,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2096#false} is VALID [2022-04-28 02:41:40,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-28 02:41:40,505 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-28 02:41:40,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:41,514 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-28 02:41:41,578 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-04-28 02:41:41,578 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-28 02:41:42,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-28 02:41:42,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2096#false} is VALID [2022-04-28 02:41:42,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2203#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:41:42,705 INFO L272 TraceCheckUtils]: 24: Hoare triple {2219#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2199#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:41:42,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {2223#(<= (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); {2219#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:41:42,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {2227#(<= (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; {2223#(<= (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-28 02:41:42,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#(<= (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); {2227#(<= (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-28 02:41:42,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#(<= (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; {2227#(<= (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-28 02:41:42,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2227#(<= (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-28 02:41:42,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 02:41:42,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {2244#(or (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10; {2237#(forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 02:41:42,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {2248#(or (<= 0 main_~i~0) (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))))} #t~short10 := ~i~0 >= 0; {2244#(or (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 02:41:42,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {2252#(or (forall ((v_main_~i~0_12 Int) (v_ArrVal_72 Int) (v_ArrVal_73 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_72)) (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) |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_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_12 1))) (<= 0 v_main_~i~0_12))) (not |main_#t~short10|))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {2248#(or (<= 0 main_~i~0) (forall ((v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_73) (+ |main_~#v~0.offset| 4))))))} is VALID [2022-04-28 02:41:42,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {2256#(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; {2252#(or (forall ((v_main_~i~0_12 Int) (v_ArrVal_72 Int) (v_ArrVal_73 Int)) (or (not (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* main_~i~0 4))) v_ArrVal_72)) (not (<= v_ArrVal_73 main_~key~0)) (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) |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_72) (+ |main_~#v~0.offset| (* v_main_~i~0_12 4) 4) v_ArrVal_73) (+ |main_~#v~0.offset| 4))) (not (<= main_~i~0 (+ v_main_~i~0_12 1))) (<= 0 v_main_~i~0_12))) (not |main_#t~short10|))} is VALID [2022-04-28 02:41:42,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {2095#true} #t~short10 := ~i~0 >= 0; {2256#(or (not |main_#t~short10|) (<= 1 main_~i~0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:41:42,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {2095#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; {2095#true} is VALID [2022-04-28 02:41:42,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {2095#true} ~j~0 := 1; {2095#true} is VALID [2022-04-28 02:41:42,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {2095#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2095#true} is VALID [2022-04-28 02:41:42,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-28 02:41:42,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {2095#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; {2095#true} is VALID [2022-04-28 02:41:42,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {2095#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2095#true} is VALID [2022-04-28 02:41:42,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {2095#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; {2095#true} is VALID [2022-04-28 02:41:42,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#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; {2095#true} is VALID [2022-04-28 02:41:42,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret15 := main(); {2095#true} is VALID [2022-04-28 02:41:42,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #87#return; {2095#true} is VALID [2022-04-28 02:41:42,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-28 02:41:42,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#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); {2095#true} is VALID [2022-04-28 02:41:42,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2022-04-28 02:41:42,713 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-28 02:41:42,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045372873] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:42,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:42,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 12] total 36 [2022-04-28 02:41:42,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:42,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1017331292] [2022-04-28 02:41:42,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1017331292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:42,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:42,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 02:41:42,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383124168] [2022-04-28 02:41:42,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:42,714 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 28 [2022-04-28 02:41:42,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:42,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-28 02:41:42,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:42,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 02:41:42,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:42,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 02:41:42,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1123, Unknown=1, NotChecked=0, Total=1260 [2022-04-28 02:41:42,741 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-28 02:41:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:44,392 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2022-04-28 02:41:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 02:41:44,392 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 28 [2022-04-28 02:41:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-28 02:41:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-28 02:41:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-28 02:41:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 103 transitions. [2022-04-28 02:41:44,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 103 transitions. [2022-04-28 02:41:44,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:44,483 INFO L225 Difference]: With dead ends: 104 [2022-04-28 02:41:44,483 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 02:41:44,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=338, Invalid=2417, Unknown=1, NotChecked=0, Total=2756 [2022-04-28 02:41:44,485 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 103 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:44,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 02:41:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 02:41:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-04-28 02:41:44,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:44,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 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-28 02:41:44,567 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 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-28 02:41:44,567 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 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-28 02:41:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:44,569 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-28 02:41:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-04-28 02:41:44,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:44,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:44,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 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 73 states. [2022-04-28 02:41:44,570 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 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 73 states. [2022-04-28 02:41:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:44,571 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-04-28 02:41:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-04-28 02:41:44,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:44,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:44,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:44,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 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-28 02:41:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-04-28 02:41:44,573 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 28 [2022-04-28 02:41:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:44,573 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-04-28 02:41:44,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-28 02:41:44,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 52 transitions. [2022-04-28 02:41:44,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-04-28 02:41:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 02:41:44,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:44,643 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-28 02:41:44,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 02:41:44,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:44,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -990333180, now seen corresponding path program 5 times [2022-04-28 02:41:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:44,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [498914490] [2022-04-28 02:41:44,850 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:44,850 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:44,850 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -990333180, now seen corresponding path program 6 times [2022-04-28 02:41:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:44,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171906702] [2022-04-28 02:41:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:44,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:44,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {2792#(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); {2781#true} is VALID [2022-04-28 02:41:44,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-28 02:41:44,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-28 02:41:44,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:44,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#(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); {2781#true} is VALID [2022-04-28 02:41:44,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-28 02:41:44,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-28 02:41:44,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret15 := main(); {2781#true} is VALID [2022-04-28 02:41:44,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#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; {2786#(= main_~j~0 0)} is VALID [2022-04-28 02:41:44,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {2786#(= 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; {2786#(= main_~j~0 0)} is VALID [2022-04-28 02:41:44,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {2786#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:44,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {2787#(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; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:44,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2788#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:44,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {2788#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:44,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:44,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:44,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:44,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:44,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:44,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(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); {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:44,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {2790#(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; {2791#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:44,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#(<= (+ 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; {2782#false} is VALID [2022-04-28 02:41:44,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} #t~short10 := ~i~0 >= 0; {2782#false} is VALID [2022-04-28 02:41:44,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#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; {2782#false} is VALID [2022-04-28 02:41:44,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2782#false} is VALID [2022-04-28 02:41:44,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2782#false} is VALID [2022-04-28 02:41:44,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2782#false} is VALID [2022-04-28 02:41:44,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2782#false} is VALID [2022-04-28 02:41:44,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} ~k~0 := 1; {2782#false} is VALID [2022-04-28 02:41:44,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#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); {2782#false} is VALID [2022-04-28 02:41:44,978 INFO L272 TraceCheckUtils]: 27: Hoare triple {2782#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2782#false} is VALID [2022-04-28 02:41:44,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {2782#false} ~cond := #in~cond; {2782#false} is VALID [2022-04-28 02:41:44,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} assume 0 == ~cond; {2782#false} is VALID [2022-04-28 02:41:44,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-28 02:41:44,978 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-28 02:41:44,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:44,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171906702] [2022-04-28 02:41:44,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171906702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:44,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159252902] [2022-04-28 02:41:44,979 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:41:44,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:44,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:44,980 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-28 02:41:44,981 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-28 02:41:45,034 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 02:41:45,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:45,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 02:41:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:45,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:45,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2781#true} is VALID [2022-04-28 02:41:45,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#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); {2781#true} is VALID [2022-04-28 02:41:45,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-28 02:41:45,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-28 02:41:45,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret15 := main(); {2781#true} is VALID [2022-04-28 02:41:45,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#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; {2786#(= main_~j~0 0)} is VALID [2022-04-28 02:41:45,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {2786#(= 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; {2786#(= main_~j~0 0)} is VALID [2022-04-28 02:41:45,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {2786#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:45,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {2787#(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; {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:45,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {2787#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 02:41:45,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {2823#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:45,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:45,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:45,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~short10 := ~i~0 >= 0; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:45,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:45,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {2790#(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; {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:45,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {2790#(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); {2790#(and (= (+ (- 1) main_~j~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:45,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {2790#(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; {2848#(and (= main_~j~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:45,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {2848#(and (= main_~j~0 2) (<= 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; {2782#false} is VALID [2022-04-28 02:41:45,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} #t~short10 := ~i~0 >= 0; {2782#false} is VALID [2022-04-28 02:41:45,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#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; {2782#false} is VALID [2022-04-28 02:41:45,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2782#false} is VALID [2022-04-28 02:41:45,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2782#false} is VALID [2022-04-28 02:41:45,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2782#false} is VALID [2022-04-28 02:41:45,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2782#false} is VALID [2022-04-28 02:41:45,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} ~k~0 := 1; {2782#false} is VALID [2022-04-28 02:41:45,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#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); {2782#false} is VALID [2022-04-28 02:41:45,488 INFO L272 TraceCheckUtils]: 27: Hoare triple {2782#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2782#false} is VALID [2022-04-28 02:41:45,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {2782#false} ~cond := #in~cond; {2782#false} is VALID [2022-04-28 02:41:45,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} assume 0 == ~cond; {2782#false} is VALID [2022-04-28 02:41:45,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-28 02:41:45,488 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-28 02:41:45,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:45,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !false; {2782#false} is VALID [2022-04-28 02:41:45,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} assume 0 == ~cond; {2782#false} is VALID [2022-04-28 02:41:45,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {2782#false} ~cond := #in~cond; {2782#false} is VALID [2022-04-28 02:41:45,892 INFO L272 TraceCheckUtils]: 27: Hoare triple {2782#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {2782#false} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#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); {2782#false} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} ~k~0 := 1; {2782#false} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2782#false} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2782#false} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {2782#false} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {2782#false} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {2782#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; {2782#false} is VALID [2022-04-28 02:41:45,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} #t~short10 := ~i~0 >= 0; {2782#false} is VALID [2022-04-28 02:41:45,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#(<= (+ 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; {2782#false} is VALID [2022-04-28 02:41:45,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {2927#(<= (+ 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; {2791#(<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:45,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {2927#(<= (+ 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); {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:45,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {2927#(<= (+ 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; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:45,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {2927#(<= (+ 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; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:45,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {2927#(<= (+ 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; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:45,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {2927#(<= (+ 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; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:45,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {2927#(<= (+ main_~SIZE~0 (* (div (+ main_~j~0 1) 4294967296) 4294967296)) (+ main_~j~0 (* (div main_~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 02:41:45,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2949#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {2789#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:45,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2949#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-28 02:41:45,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#(<= 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; {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 02:41:45,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {2953#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 02:41:45,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {2960#(<= 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; {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 02:41:45,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#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; {2960#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 02:41:45,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {2781#true} call #t~ret15 := main(); {2781#true} is VALID [2022-04-28 02:41:45,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2781#true} {2781#true} #87#return; {2781#true} is VALID [2022-04-28 02:41:45,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-04-28 02:41:45,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#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); {2781#true} is VALID [2022-04-28 02:41:45,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {2781#true} call ULTIMATE.init(); {2781#true} is VALID [2022-04-28 02:41:45,903 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-28 02:41:45,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159252902] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:45,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:45,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-28 02:41:45,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:45,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [498914490] [2022-04-28 02:41:45,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [498914490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:45,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:45,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:41:45,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747373817] [2022-04-28 02:41:45,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:45,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 31 [2022-04-28 02:41:45,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:45,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-28 02:41:45,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:45,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:41:45,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:45,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:41:45,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-28 02:41:45,927 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-28 02:41:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:46,501 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2022-04-28 02:41:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:41:46,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 31 [2022-04-28 02:41:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-28 02:41:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-04-28 02:41:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-28 02:41:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2022-04-28 02:41:46,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 91 transitions. [2022-04-28 02:41:46,591 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-28 02:41:46,593 INFO L225 Difference]: With dead ends: 86 [2022-04-28 02:41:46,593 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 02:41:46,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-28 02:41:46,593 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 118 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:46,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 44 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 02:41:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2022-04-28 02:41:46,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:46,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 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-28 02:41:46,736 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 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-28 02:41:46,736 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 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-28 02:41:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:46,738 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 02:41:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-28 02:41:46,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:46,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:46,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 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 69 states. [2022-04-28 02:41:46,739 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 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 69 states. [2022-04-28 02:41:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:46,741 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-28 02:41:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-28 02:41:46,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:46,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:46,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:46,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 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-28 02:41:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-04-28 02:41:46,742 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 31 [2022-04-28 02:41:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:46,743 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-04-28 02:41:46,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-28 02:41:46,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 67 transitions. [2022-04-28 02:41:46,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-04-28 02:41:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 02:41:46,830 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:46,830 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-28 02:41:46,849 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-28 02:41:47,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:47,033 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash -405243253, now seen corresponding path program 1 times [2022-04-28 02:41:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:47,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820193216] [2022-04-28 02:41:47,037 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:47,037 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:47,037 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:47,037 INFO L85 PathProgramCache]: Analyzing trace with hash -405243253, now seen corresponding path program 2 times [2022-04-28 02:41:47,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:47,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623346134] [2022-04-28 02:41:47,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:47,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:47,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {3439#(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); {3424#true} is VALID [2022-04-28 02:41:47,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-28 02:41:47,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-28 02:41:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 02:41:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:47,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-28 02:41:47,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-28 02:41:47,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-28 02:41:47,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #85#return; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:47,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {3439#(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); {3424#true} is VALID [2022-04-28 02:41:47,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-28 02:41:47,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-28 02:41:47,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret15 := main(); {3424#true} is VALID [2022-04-28 02:41:47,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#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; {3429#(= main_~j~0 0)} is VALID [2022-04-28 02:41:47,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#(= 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; {3429#(= main_~j~0 0)} is VALID [2022-04-28 02:41:47,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:47,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#(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; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:47,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3431#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:47,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {3431#(and (<= main_~j~0 2) (not (<= (+ (div main_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(<= 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); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (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); {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,160 INFO L272 TraceCheckUtils]: 21: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3424#true} is VALID [2022-04-28 02:41:47,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-28 02:41:47,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-28 02:41:47,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-28 02:41:47,161 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3424#true} {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #85#return; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} havoc #t~mem13;havoc #t~mem14; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3438#(and (<= (div main_~k~0 4294967296) 0) (<= main_~SIZE~0 (+ main_~k~0 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {3438#(and (<= (div main_~k~0 4294967296) 0) (<= main_~SIZE~0 (+ 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); {3425#false} is VALID [2022-04-28 02:41:47,164 INFO L272 TraceCheckUtils]: 29: Hoare triple {3425#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3425#false} is VALID [2022-04-28 02:41:47,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {3425#false} ~cond := #in~cond; {3425#false} is VALID [2022-04-28 02:41:47,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {3425#false} assume 0 == ~cond; {3425#false} is VALID [2022-04-28 02:41:47,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-28 02:41:47,164 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-28 02:41:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:47,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623346134] [2022-04-28 02:41:47,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623346134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:47,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598719647] [2022-04-28 02:41:47,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:47,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:47,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:47,166 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-28 02:41:47,166 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-28 02:41:47,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:47,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:47,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 02:41:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:47,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:47,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3424#true} is VALID [2022-04-28 02:41:47,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#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); {3424#true} is VALID [2022-04-28 02:41:47,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-28 02:41:47,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-28 02:41:47,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret15 := main(); {3424#true} is VALID [2022-04-28 02:41:47,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#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; {3429#(= main_~j~0 0)} is VALID [2022-04-28 02:41:47,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#(= 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; {3429#(= main_~j~0 0)} is VALID [2022-04-28 02:41:47,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#(= main_~j~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:47,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#(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; {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:47,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#(and (<= 1 main_~j~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3470#(and (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 02:41:47,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {3470#(and (<= main_~j~0 2) (<= 2 main_~j~0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(<= 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); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:47,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (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); {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,708 INFO L272 TraceCheckUtils]: 21: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3424#true} is VALID [2022-04-28 02:41:47,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-28 02:41:47,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-28 02:41:47,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-28 02:41:47,709 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3424#true} {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #85#return; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} havoc #t~mem13;havoc #t~mem14; {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {3433#(and (= (+ (- 1) main_~k~0) 0) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3525#(and (= main_~k~0 2) (<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 02:41:47,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {3525#(and (= main_~k~0 2) (<= main_~SIZE~0 (+ 2 (* (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); {3425#false} is VALID [2022-04-28 02:41:47,710 INFO L272 TraceCheckUtils]: 29: Hoare triple {3425#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3425#false} is VALID [2022-04-28 02:41:47,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {3425#false} ~cond := #in~cond; {3425#false} is VALID [2022-04-28 02:41:47,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {3425#false} assume 0 == ~cond; {3425#false} is VALID [2022-04-28 02:41:47,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-28 02:41:47,711 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-28 02:41:47,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:41:48,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-28 02:41:48,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {3425#false} assume 0 == ~cond; {3425#false} is VALID [2022-04-28 02:41:48,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {3425#false} ~cond := #in~cond; {3425#false} is VALID [2022-04-28 02:41:48,089 INFO L272 TraceCheckUtils]: 29: Hoare triple {3425#false} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3425#false} is VALID [2022-04-28 02:41:48,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {3553#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 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); {3425#false} is VALID [2022-04-28 02:41:48,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #t~post12 := ~k~0;~k~0 := 1 + #t~post12;havoc #t~post12; {3553#(not (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:41:48,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} havoc #t~mem13;havoc #t~mem14; {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:41:48,091 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3424#true} {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} #85#return; {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:41:48,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-28 02:41:48,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} assume !(0 == ~cond); {3424#true} is VALID [2022-04-28 02:41:48,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} ~cond := #in~cond; {3424#true} is VALID [2022-04-28 02:41:48,091 INFO L272 TraceCheckUtils]: 21: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {3424#true} is VALID [2022-04-28 02:41:48,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 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); {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:41:48,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~k~0 := 1; {3557#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-28 02:41:48,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:48,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:48,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(<= 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); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:48,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:48,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:48,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} #t~short10 := ~i~0 >= 0; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:48,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(<= 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; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:48,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} ~j~0 := 1; {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:48,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {3609#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3432#(<= main_~SIZE~0 (+ 2 (* (div main_~SIZE~0 4294967296) 4294967296)))} is VALID [2022-04-28 02:41:48,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3609#(<= 0 (div (+ 2 (* (- 1) (mod main_~j~0 4294967296))) 4294967296))} is VALID [2022-04-28 02:41:48,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {3613#(<= 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; {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 02:41:48,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3613#(<= 0 (div (+ (* (- 1) (mod (+ main_~j~0 1) 4294967296)) 2) 4294967296))} is VALID [2022-04-28 02:41:48,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {3620#(<= 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; {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 02:41:48,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#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; {3620#(<= 0 (div (+ 2 (* (- 1) (mod (+ main_~j~0 2) 4294967296))) 4294967296))} is VALID [2022-04-28 02:41:48,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret15 := main(); {3424#true} is VALID [2022-04-28 02:41:48,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #87#return; {3424#true} is VALID [2022-04-28 02:41:48,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-28 02:41:48,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#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); {3424#true} is VALID [2022-04-28 02:41:48,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3424#true} is VALID [2022-04-28 02:41:48,098 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-28 02:41:48,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598719647] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:41:48,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:41:48,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 02:41:48,098 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:48,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820193216] [2022-04-28 02:41:48,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820193216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:48,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:48,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:41:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411724984] [2022-04-28 02:41:48,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:48,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-28 02:41:48,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:48,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:48,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:48,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:41:48,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:41:48,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:41:48,130 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:48,719 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-04-28 02:41:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 02:41:48,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-04-28 02:41:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 02:41:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-28 02:41:48,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-28 02:41:48,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:48,791 INFO L225 Difference]: With dead ends: 78 [2022-04-28 02:41:48,791 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 02:41:48,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-04-28 02:41:48,792 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 103 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:48,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 43 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 02:41:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-28 02:41:48,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:48,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-28 02:41:48,871 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-28 02:41:48,871 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-28 02:41:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:48,879 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-28 02:41:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-28 02:41:48,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:48,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:48,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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 47 states. [2022-04-28 02:41:48,880 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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 47 states. [2022-04-28 02:41:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:48,881 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-28 02:41:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-28 02:41:48,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:48,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:48,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:48,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-28 02:41:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-28 02:41:48,883 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 33 [2022-04-28 02:41:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:48,883 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-28 02:41:48,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 02:41:48,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2022-04-28 02:41:48,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-28 02:41:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 02:41:48,936 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:48,936 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-28 02:41:48,952 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-28 02:41:49,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:49,137 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:49,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1306424002, now seen corresponding path program 7 times [2022-04-28 02:41:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:49,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [297809149] [2022-04-28 02:41:49,140 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:49,140 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:41:49,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:41:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1306424002, now seen corresponding path program 8 times [2022-04-28 02:41:49,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:49,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115642093] [2022-04-28 02:41:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:49,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:49,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {4011#(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); {3990#true} is VALID [2022-04-28 02:41:49,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-28 02:41:49,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-28 02:41:49,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {4011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:49,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {4011#(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); {3990#true} is VALID [2022-04-28 02:41:49,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-28 02:41:49,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-28 02:41:49,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret15 := main(); {3990#true} is VALID [2022-04-28 02:41:49,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#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; {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:49,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {3995#(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; {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:41:49,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {3995#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:49,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {3996#(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; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:49,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {3996#(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; {3997#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| (* main_~j~0 4)) 0)))} is VALID [2022-04-28 02:41:49,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {3997#(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; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:49,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:49,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {3998#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:49,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {3998#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:49,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {3996#(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; {3999#(and (or (<= (+ main_~i~0 1) 0) (and (= |main_~#v~0.offset| 0) (<= (+ main_~i~0 1) main_~j~0))) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-28 02:41:49,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {3999#(and (or (<= (+ main_~i~0 1) 0) (and (= |main_~#v~0.offset| 0) (<= (+ main_~i~0 1) main_~j~0))) (= (+ (- 1) main_~j~0) 0))} #t~short10 := ~i~0 >= 0; {4000#(or (and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~0)) (not |main_#t~short10|))} is VALID [2022-04-28 02:41:49,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {4000#(or (and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) 0) (<= 0 main_~i~0) (<= (+ main_~i~0 1) main_~j~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; {4001#(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-28 02:41:49,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {4001#(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; {4002#(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-28 02:41:49,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {4002#(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); {4003#(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-28 02:41:49,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {4003#(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; {4004#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~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-28 02:41:49,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {4004#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~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);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; {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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-28 02:41:49,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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-28 02:41:49,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |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; {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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-28 02:41:49,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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-28 02:41:49,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {4005#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (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); {4006#(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-28 02:41:49,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {4006#(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; {4006#(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-28 02:41:49,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {4006#(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); {4006#(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-28 02:41:49,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {4006#(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; {4007#(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-28 02:41:49,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {4007#(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); {4008#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:41:49,597 INFO L272 TraceCheckUtils]: 29: Hoare triple {4008#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:41:49,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {4009#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4010#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:41:49,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {4010#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3991#false} is VALID [2022-04-28 02:41:49,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-28 02:41:49,598 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-28 02:41:49,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:49,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115642093] [2022-04-28 02:41:49,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115642093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:41:49,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848481827] [2022-04-28 02:41:49,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:41:49,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:41:49,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:49,599 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-28 02:41:49,600 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-28 02:41:49,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:41:49,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:41:49,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 02:41:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:49,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:41:49,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:41:49,996 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-28 02:41:50,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:41:50,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:41:50,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:41:50,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:50,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-04-28 02:41:50,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:41:50,253 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-28 02:41:50,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {3990#true} is VALID [2022-04-28 02:41:50,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#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); {3990#true} is VALID [2022-04-28 02:41:50,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-28 02:41:50,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-28 02:41:50,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret15 := main(); {3990#true} is VALID [2022-04-28 02:41:50,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#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; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:50,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {3998#(= |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; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:50,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:50,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {3998#(= |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; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:50,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:50,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {3998#(= |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; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:50,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {3998#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:50,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {3998#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3998#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:41:50,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {3998#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {3996#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:50,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {3996#(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; {4057#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:41:50,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {4057#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {4061#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1) |main_#t~short10|)} is VALID [2022-04-28 02:41:50,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {4061#(and (= |main_~#v~0.offset| 0) (= (+ (- 1) main_~j~0) main_~i~0) (<= 1 main_~j~0) (<= main_~j~0 1) |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; {4001#(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-28 02:41:50,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {4001#(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; {4002#(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-28 02:41:50,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {4002#(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); {4003#(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-28 02:41:50,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {4003#(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; {4004#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~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-28 02:41:50,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {4004#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 2) main_~j~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);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; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~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-28 02:41:50,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~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-28 02:41:50,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |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; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~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-28 02:41:50,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~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-28 02:41:50,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {4077#(and (= |main_~#v~0.offset| 0) (<= (+ (div (* (- 1) |main_~#v~0.offset|) 4) 1) main_~i~0) (<= (select (select |#memory_int| |main_~#v~0.base|) 0) (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); {4006#(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-28 02:41:50,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {4006#(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; {4006#(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-28 02:41:50,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {4006#(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); {4006#(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-28 02:41:50,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {4006#(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; {4007#(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-28 02:41:50,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {4007#(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); {4008#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:41:50,343 INFO L272 TraceCheckUtils]: 29: Hoare triple {4008#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:41:50,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4109#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:41:50,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {4109#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3991#false} is VALID [2022-04-28 02:41:50,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-28 02:41:50,344 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-28 02:41:50,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:11,286 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-28 02:42:11,344 INFO L356 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-04-28 02:42:11,344 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 1429 treesize of output 1347 [2022-04-28 02:42:18,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {3991#false} assume !false; {3991#false} is VALID [2022-04-28 02:42:18,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {4109#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3991#false} is VALID [2022-04-28 02:42:18,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4109#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:18,415 INFO L272 TraceCheckUtils]: 29: Hoare triple {4008#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4105#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:18,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {4128#(<= (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); {4008#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:18,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {4132#(<= (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; {4128#(<= (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-28 02:42:18,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {4132#(<= (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); {4132#(<= (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-28 02:42:18,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {4132#(<= (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; {4132#(<= (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-28 02:42:18,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4132#(<= (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-28 02:42:18,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:18,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |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; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:18,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:18,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {4155#(forall ((v_main_~i~0_18 Int)) (or (forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4)))) (not (<= main_~j~0 (+ v_main_~i~0_18 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; {4142#(forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_137) (+ |main_~#v~0.offset| 4))))} is VALID [2022-04-28 02:42:18,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {4159#(forall ((v_ArrVal_137 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (< v_main_~i~0_18 main_~j~0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4155#(forall ((v_main_~i~0_18 Int)) (or (forall ((v_ArrVal_137 Int)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4)))) (not (<= main_~j~0 (+ v_main_~i~0_18 1)))))} is VALID [2022-04-28 02:42:18,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {4163#(forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |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_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4159#(forall ((v_ArrVal_137 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (< v_main_~i~0_18 main_~j~0)))} is VALID [2022-04-28 02:42:18,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {4167#(or (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |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_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4163#(forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |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_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0)))} is VALID [2022-04-28 02:42:18,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {4171#(or (not |main_#t~short10|) (and (< 0 main_~j~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; {4167#(or (forall ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (v_main_~i~0_18 Int)) (or (<= (select (store (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) |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_135) (+ (* v_main_~i~0_18 4) |main_~#v~0.offset| 4) v_ArrVal_137) (+ |main_~#v~0.offset| 4))) (not (<= main_~key~0 v_ArrVal_135)) (< v_main_~i~0_18 main_~j~0))) |main_#t~short10|)} is VALID [2022-04-28 02:42:18,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {4175#(or (not (<= 0 main_~i~0)) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {4171#(or (not |main_#t~short10|) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 02:42:18,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {4179#(or (not (<= 1 main_~j~0)) (= (* 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; {4175#(or (not (<= 0 main_~i~0)) (and (< 0 main_~j~0) (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 02:42:18,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {3990#true} ~j~0 := 1; {4179#(or (not (<= 1 main_~j~0)) (= (* main_~j~0 4) 4))} is VALID [2022-04-28 02:42:18,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {3990#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {3990#true} is VALID [2022-04-28 02:42:18,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {3990#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3990#true} is VALID [2022-04-28 02:42:18,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {3990#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; {3990#true} is VALID [2022-04-28 02:42:18,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {3990#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3990#true} is VALID [2022-04-28 02:42:18,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {3990#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; {3990#true} is VALID [2022-04-28 02:42:18,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {3990#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {3990#true} is VALID [2022-04-28 02:42:18,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {3990#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; {3990#true} is VALID [2022-04-28 02:42:18,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {3990#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; {3990#true} is VALID [2022-04-28 02:42:18,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {3990#true} call #t~ret15 := main(); {3990#true} is VALID [2022-04-28 02:42:18,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3990#true} {3990#true} #87#return; {3990#true} is VALID [2022-04-28 02:42:18,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {3990#true} assume true; {3990#true} is VALID [2022-04-28 02:42:18,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {3990#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); {3990#true} is VALID [2022-04-28 02:42:18,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {3990#true} call ULTIMATE.init(); {3990#true} is VALID [2022-04-28 02:42:18,426 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-28 02:42:18,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848481827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:18,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:18,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 34 [2022-04-28 02:42:18,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:18,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [297809149] [2022-04-28 02:42:18,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [297809149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:18,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:18,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 02:42:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300084934] [2022-04-28 02:42:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:18,427 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 33 [2022-04-28 02:42:18,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:18,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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-28 02:42:18,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:18,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 02:42:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:18,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 02:42:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=954, Unknown=19, NotChecked=0, Total=1122 [2022-04-28 02:42:18,487 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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-28 02:42:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:20,477 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-28 02:42:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 02:42:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 33 [2022-04-28 02:42:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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-28 02:42:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 139 transitions. [2022-04-28 02:42:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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-28 02:42:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 139 transitions. [2022-04-28 02:42:20,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 139 transitions. [2022-04-28 02:42:20,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:20,597 INFO L225 Difference]: With dead ends: 118 [2022-04-28 02:42:20,597 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 02:42:20,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=527, Invalid=2876, Unknown=19, NotChecked=0, Total=3422 [2022-04-28 02:42:20,599 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 162 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:20,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 61 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 02:42:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 02:42:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2022-04-28 02:42:20,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:20,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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-28 02:42:20,746 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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-28 02:42:20,747 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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-28 02:42:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:20,748 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-04-28 02:42:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-04-28 02:42:20,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:20,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:20,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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 101 states. [2022-04-28 02:42:20,749 INFO L87 Difference]: Start difference. First operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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 101 states. [2022-04-28 02:42:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:20,751 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2022-04-28 02:42:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2022-04-28 02:42:20,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:20,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:20,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:20,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 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-28 02:42:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-04-28 02:42:20,754 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 33 [2022-04-28 02:42:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:20,754 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-04-28 02:42:20,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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-28 02:42:20,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 77 transitions. [2022-04-28 02:42:20,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-04-28 02:42:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 02:42:20,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:20,857 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] [2022-04-28 02:42:20,873 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-28 02:42:21,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:21,060 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:21,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash -350564349, now seen corresponding path program 1 times [2022-04-28 02:42:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:21,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273481578] [2022-04-28 02:42:21,063 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:21,063 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:21,063 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash -350564349, now seen corresponding path program 2 times [2022-04-28 02:42:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:21,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29792842] [2022-04-28 02:42:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:21,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:21,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {4860#(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); {4842#true} is VALID [2022-04-28 02:42:21,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-28 02:42:21,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-28 02:42:21,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {4842#true} call ULTIMATE.init(); {4860#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:21,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {4860#(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); {4842#true} is VALID [2022-04-28 02:42:21,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-28 02:42:21,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-28 02:42:21,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {4842#true} call #t~ret15 := main(); {4842#true} is VALID [2022-04-28 02:42:21,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#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; {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:21,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {4847#(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; {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:21,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {4847#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:21,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {4848#(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; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:21,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {4848#(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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:21,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {4849#(= |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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:21,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:21,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:21,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {4849#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:21,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {4848#(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; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:21,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:21,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {4848#(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; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:21,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:21,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {4848#(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); {4848#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:21,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {4848#(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; {4850#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} is VALID [2022-04-28 02:42:21,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {4850#(and (= |main_~#v~0.offset| 0) (= (* main_~j~0 4) 8))} 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; {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:21,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:21,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {4851#(and (= |main_~#v~0.offset| 0) (= 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; {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:21,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {4851#(and (= |main_~#v~0.offset| 0) (= 4 (* main_~i~0 4)))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:21,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {4852#(and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:21,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {4852#(and (= |main_~#v~0.offset| 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; {4853#(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-28 02:42:21,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {4853#(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; {4854#(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-28 02:42:21,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {4854#(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); {4855#(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-28 02:42:21,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {4855#(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; {4855#(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-28 02:42:21,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {4855#(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); {4855#(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-28 02:42:21,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {4855#(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; {4856#(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-28 02:42:21,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {4856#(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); {4857#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:21,411 INFO L272 TraceCheckUtils]: 32: Hoare triple {4857#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4858#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:21,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {4858#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4859#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:21,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {4859#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4843#false} is VALID [2022-04-28 02:42:21,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-04-28 02:42:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:42:21,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:21,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29792842] [2022-04-28 02:42:21,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29792842] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:21,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668427908] [2022-04-28 02:42:21,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:42:21,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:21,414 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-28 02:42:21,415 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-28 02:42:21,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:42:21,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:21,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 02:42:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:21,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:21,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:21,833 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-28 02:42:21,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:21,949 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-28 02:42:22,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {4842#true} call ULTIMATE.init(); {4842#true} is VALID [2022-04-28 02:42:22,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#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); {4842#true} is VALID [2022-04-28 02:42:22,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-28 02:42:22,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-28 02:42:22,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {4842#true} call #t~ret15 := main(); {4842#true} is VALID [2022-04-28 02:42:22,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:22,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {4849#(= |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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:22,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:22,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {4849#(= |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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:22,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:22,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {4849#(= |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; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:22,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {4849#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:22,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {4849#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4849#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:22,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {4849#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:22,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {4903#(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; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:22,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:22,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {4903#(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; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:22,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:22,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {4903#(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); {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:22,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {4903#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 1))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {4922#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2))} is VALID [2022-04-28 02:42:22,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {4922#(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; {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-28 02:42:22,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} #t~short10 := ~i~0 >= 0; {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-28 02:42:22,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {4926#(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; {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} is VALID [2022-04-28 02:42:22,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {4926#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {4936#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} is VALID [2022-04-28 02:42:22,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {4936#(and (= |main_~#v~0.offset| 0) (<= main_~i~0 0))} #t~short10 := ~i~0 >= 0; {4940#(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-28 02:42:22,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {4940#(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; {4853#(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-28 02:42:22,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {4853#(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; {4854#(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-28 02:42:22,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {4854#(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); {4855#(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-28 02:42:22,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {4855#(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; {4855#(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-28 02:42:22,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {4855#(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); {4855#(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-28 02:42:22,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {4855#(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; {4856#(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-28 02:42:22,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {4856#(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); {4857#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:22,027 INFO L272 TraceCheckUtils]: 32: Hoare triple {4857#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:22,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4969#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:22,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {4969#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4843#false} is VALID [2022-04-28 02:42:22,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-04-28 02:42:22,028 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-28 02:42:22,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:24,345 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-28 02:42:24,375 INFO L356 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-04-28 02:42:24,375 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-28 02:42:24,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {4843#false} assume !false; {4843#false} is VALID [2022-04-28 02:42:24,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {4969#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4843#false} is VALID [2022-04-28 02:42:24,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4969#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:24,661 INFO L272 TraceCheckUtils]: 32: Hoare triple {4857#(<= |main_#t~mem13| |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {4965#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:24,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {4988#(<= (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); {4857#(<= |main_#t~mem13| |main_#t~mem14|)} is VALID [2022-04-28 02:42:24,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {4992#(<= (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; {4988#(<= (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-28 02:42:24,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {4992#(<= (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); {4992#(<= (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-28 02:42:24,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {4992#(<= (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; {4992#(<= (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-28 02:42:24,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {5002#(forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4)))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {4992#(<= (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-28 02:42:24,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {5006#(or (forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5002#(forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4)))))} is VALID [2022-04-28 02:42:24,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {5010#(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; {5006#(or (forall ((v_ArrVal_167 Int)) (or (not (<= main_~key~0 v_ArrVal_167)) (<= (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) v_ArrVal_167) (+ |main_~#v~0.offset| 4))))) |main_#t~short10|)} is VALID [2022-04-28 02:42:24,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {5014#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} #t~short10 := ~i~0 >= 0; {5010#(or (not |main_#t~short10|) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:24,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {5018#(<= main_~i~0 1)} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {5014#(or (not (<= 0 main_~i~0)) (= 0 (* main_~i~0 4)))} is VALID [2022-04-28 02:42:24,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {5018#(<= 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; {5018#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:24,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {5018#(<= main_~i~0 1)} #t~short10 := ~i~0 >= 0; {5018#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:24,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {5028#(<= 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; {5018#(<= main_~i~0 1)} is VALID [2022-04-28 02:42:24,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {5032#(<= main_~j~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5028#(<= main_~j~0 2)} is VALID [2022-04-28 02:42:24,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {5032#(<= main_~j~0 1)} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5032#(<= main_~j~0 1)} is VALID [2022-04-28 02:42:24,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {5032#(<= main_~j~0 1)} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5032#(<= main_~j~0 1)} is VALID [2022-04-28 02:42:24,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {5032#(<= 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; {5032#(<= main_~j~0 1)} is VALID [2022-04-28 02:42:24,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {5032#(<= main_~j~0 1)} #t~short10 := ~i~0 >= 0; {5032#(<= main_~j~0 1)} is VALID [2022-04-28 02:42:24,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {5032#(<= 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; {5032#(<= main_~j~0 1)} is VALID [2022-04-28 02:42:24,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {4842#true} ~j~0 := 1; {5032#(<= main_~j~0 1)} is VALID [2022-04-28 02:42:24,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {4842#true} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {4842#true} is VALID [2022-04-28 02:42:24,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {4842#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4842#true} is VALID [2022-04-28 02:42:24,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {4842#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; {4842#true} is VALID [2022-04-28 02:42:24,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {4842#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4842#true} is VALID [2022-04-28 02:42:24,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {4842#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; {4842#true} is VALID [2022-04-28 02:42:24,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {4842#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {4842#true} is VALID [2022-04-28 02:42:24,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {4842#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; {4842#true} is VALID [2022-04-28 02:42:24,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {4842#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; {4842#true} is VALID [2022-04-28 02:42:24,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {4842#true} call #t~ret15 := main(); {4842#true} is VALID [2022-04-28 02:42:24,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4842#true} {4842#true} #87#return; {4842#true} is VALID [2022-04-28 02:42:24,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {4842#true} assume true; {4842#true} is VALID [2022-04-28 02:42:24,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {4842#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); {4842#true} is VALID [2022-04-28 02:42:24,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {4842#true} call ULTIMATE.init(); {4842#true} is VALID [2022-04-28 02:42:24,670 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-28 02:42:24,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668427908] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:24,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:24,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 32 [2022-04-28 02:42:24,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:24,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273481578] [2022-04-28 02:42:24,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273481578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:24,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:24,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 02:42:24,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929143537] [2022-04-28 02:42:24,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:24,672 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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 36 [2022-04-28 02:42:24,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:24,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-28 02:42:24,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:24,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 02:42:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:24,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 02:42:24,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=861, Unknown=1, NotChecked=0, Total=992 [2022-04-28 02:42:24,704 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-28 02:42:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:26,978 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2022-04-28 02:42:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 02:42:26,978 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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 36 [2022-04-28 02:42:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-28 02:42:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 138 transitions. [2022-04-28 02:42:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-28 02:42:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 138 transitions. [2022-04-28 02:42:26,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 138 transitions. [2022-04-28 02:42:27,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:27,105 INFO L225 Difference]: With dead ends: 164 [2022-04-28 02:42:27,105 INFO L226 Difference]: Without dead ends: 162 [2022-04-28 02:42:27,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=580, Invalid=3079, Unknown=1, NotChecked=0, Total=3660 [2022-04-28 02:42:27,106 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 171 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:27,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 75 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 02:42:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-28 02:42:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 84. [2022-04-28 02:42:27,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:27,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 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-28 02:42:27,347 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 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-28 02:42:27,347 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 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-28 02:42:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:27,350 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2022-04-28 02:42:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2022-04-28 02:42:27,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:27,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:27,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 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 162 states. [2022-04-28 02:42:27,350 INFO L87 Difference]: Start difference. First operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 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 162 states. [2022-04-28 02:42:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:27,353 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2022-04-28 02:42:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2022-04-28 02:42:27,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:27,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:27,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:27,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 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-28 02:42:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-04-28 02:42:27,355 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 36 [2022-04-28 02:42:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:27,355 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-04-28 02:42:27,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-28 02:42:27,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 107 transitions. [2022-04-28 02:42:27,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-28 02:42:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 02:42:27,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:27,531 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] [2022-04-28 02:42:27,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:27,739 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,SelfDestructingSolverStorable10 [2022-04-28 02:42:27,739 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1169352267, now seen corresponding path program 3 times [2022-04-28 02:42:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:27,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2009645575] [2022-04-28 02:42:27,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:42:27,743 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-28 02:42:27,743 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 02:42:27,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1169352267, now seen corresponding path program 4 times [2022-04-28 02:42:27,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:27,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149274255] [2022-04-28 02:42:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:27,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {5993#(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); {5970#true} is VALID [2022-04-28 02:42:28,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-28 02:42:28,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-28 02:42:28,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {5970#true} call ULTIMATE.init(); {5993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:28,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {5993#(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); {5970#true} is VALID [2022-04-28 02:42:28,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-28 02:42:28,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-28 02:42:28,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {5970#true} call #t~ret15 := main(); {5970#true} is VALID [2022-04-28 02:42:28,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {5970#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; {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:28,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {5975#(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; {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} is VALID [2022-04-28 02:42:28,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {5975#(and (= |main_~#v~0.offset| 0) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:28,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {5976#(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; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:28,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {5976#(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; {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 02:42:28,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {5977#(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; {5977#(and (= |main_~#v~0.offset| 0) (<= main_~j~0 2) (<= 2 main_~j~0))} is VALID [2022-04-28 02:42:28,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {5977#(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; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:28,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {5978#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:28,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {5978#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:28,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {5976#(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; {5979#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} is VALID [2022-04-28 02:42:28,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {5979#(and (= |main_~#v~0.offset| 0) (= main_~j~0 1) (<= (+ main_~i~0 1) main_~j~0))} #t~short10 := ~i~0 >= 0; {5980#(and (= (+ (- 1) main_~j~0) 0) (or (and (= |main_~#v~0.offset| 0) (= 0 (* main_~i~0 4))) (not |main_#t~short10|)))} is VALID [2022-04-28 02:42:28,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {5980#(and (= (+ (- 1) main_~j~0) 0) (or (and (= |main_~#v~0.offset| 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; {5981#(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-28 02:42:28,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {5981#(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;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;~i~0 := ~i~0 - 1; {5982#(and (= |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| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)) (not (= 0 (* main_~i~0 4))))} is VALID [2022-04-28 02:42:28,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {5982#(and (= |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| 4))) (or (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0) (<= 0 main_~i~0)) (not (= 0 (* main_~i~0 4))))} #t~short10 := ~i~0 >= 0; {5983#(and (= |main_~#v~0.offset| 0) (or (and (= (+ |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|) (= (+ (- 1) main_~j~0) 0))} is VALID [2022-04-28 02:42:28,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {5983#(and (= |main_~#v~0.offset| 0) (or (and (= (+ |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|) (= (+ (- 1) main_~j~0) 0))} assume !#t~short10; {5984#(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-28 02:42:28,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {5984#(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; {5984#(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-28 02:42:28,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {5984#(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); {5985#(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-28 02:42:28,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {5985#(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; {5986#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~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-28 02:42:28,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {5986#(and (= |main_~#v~0.offset| 0) (<= 2 main_~j~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);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; {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 02:42:28,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} #t~short10 := ~i~0 >= 0; {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 02:42:28,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 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; {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 02:42:28,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} is VALID [2022-04-28 02:42:28,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {5987#(and (= |main_~#v~0.offset| 0) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) (+ |main_~#v~0.offset| 4))) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))) (not (= (+ |main_~#v~0.offset| 4 (* main_~i~0 4)) 0)))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5988#(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-28 02:42:28,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {5988#(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; {5988#(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-28 02:42:28,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {5988#(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); {5988#(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-28 02:42:28,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {5988#(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; {5989#(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-28 02:42:28,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {5989#(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); {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 02:42:28,288 INFO L272 TraceCheckUtils]: 32: Hoare triple {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {5991#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:28,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {5991#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5992#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:28,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {5992#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5971#false} is VALID [2022-04-28 02:42:28,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {5971#false} assume !false; {5971#false} is VALID [2022-04-28 02:42:28,289 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-28 02:42:28,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:28,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149274255] [2022-04-28 02:42:28,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149274255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:28,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906703805] [2022-04-28 02:42:28,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:42:28,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:28,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:28,291 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-28 02:42:28,292 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-28 02:42:28,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:42:28,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:42:28,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 02:42:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:28,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:28,726 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 39 treesize of output 30 [2022-04-28 02:42:29,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:29,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 02:42:29,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:29,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-04-28 02:42:29,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:29,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:29,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 02:42:29,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:29,668 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 29 treesize of output 31 [2022-04-28 02:42:29,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-28 02:42:29,726 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 28 treesize of output 12 [2022-04-28 02:42:29,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {5970#true} call ULTIMATE.init(); {5970#true} is VALID [2022-04-28 02:42:29,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {5970#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); {5970#true} is VALID [2022-04-28 02:42:29,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {5970#true} assume true; {5970#true} is VALID [2022-04-28 02:42:29,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5970#true} {5970#true} #87#return; {5970#true} is VALID [2022-04-28 02:42:29,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {5970#true} call #t~ret15 := main(); {5970#true} is VALID [2022-04-28 02:42:29,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {5970#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; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:29,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {5978#(= |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; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:29,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {5978#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:29,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {5978#(= |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; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:29,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {5978#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:29,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {5978#(= |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; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:29,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {5978#(= |main_~#v~0.offset| 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:29,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {5978#(= |main_~#v~0.offset| 0)} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {5978#(= |main_~#v~0.offset| 0)} is VALID [2022-04-28 02:42:29,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {5978#(= |main_~#v~0.offset| 0)} ~j~0 := 1; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:29,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {5976#(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; {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:29,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {5976#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1))} #t~short10 := ~i~0 >= 0; {6042#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 02:42:29,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {6042#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (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; {6046#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~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) (<= main_~j~0 1))} is VALID [2022-04-28 02:42:29,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {6046#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~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) (<= main_~j~0 1))} assume !!#t~short10;havoc #t~mem9;havoc #t~short10;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;~i~0 := ~i~0 - 1; {6050#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-28 02:42:29,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {6050#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} #t~short10 := ~i~0 >= 0; {6054#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} is VALID [2022-04-28 02:42:29,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {6054#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))) (or (and (<= 0 main_~i~0) |main_#t~short10|) (and (not (<= 0 main_~i~0)) (not |main_#t~short10|))))} assume !#t~short10; {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-28 02:42:29,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} is VALID [2022-04-28 02:42:29,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {6058#(and (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (< main_~i~0 0) (<= main_~j~0 1) (exists ((v_main_~i~0_24 Int)) (and (<= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4))) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4) 4))) (<= v_main_~i~0_24 (+ main_~i~0 1)) (<= 0 v_main_~i~0_24) (< main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* v_main_~i~0_24 4)))))))} call write~int(~key~0, ~#v~0.base, ~#v~0.offset + 4 * (1 + ~i~0), 4); {5985#(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-28 02:42:29,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {5985#(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; {6068#(and (= |main_~#v~0.offset| 0) (= main_~j~0 2) (<= (+ (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-28 02:42:29,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {6068#(and (= |main_~#v~0.offset| 0) (= main_~j~0 2) (<= (+ (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);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; {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (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-28 02:42:29,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} #t~short10 := ~i~0 >= 0; {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (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-28 02:42:29,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |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; {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (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-28 02:42:29,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 0) 1) (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| 4))))} assume !#t~short10;havoc #t~mem9;havoc #t~short10; {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (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-28 02:42:29,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {6072#(and (= |main_~#v~0.offset| 0) (= 2 (+ main_~i~0 1)) (<= (+ (select (select |#memory_int| |main_~#v~0.base|) 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); {5988#(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-28 02:42:29,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {5988#(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; {5988#(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-28 02:42:29,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {5988#(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); {5988#(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-28 02:42:29,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {5988#(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; {5989#(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-28 02:42:29,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {5989#(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); {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} is VALID [2022-04-28 02:42:29,811 INFO L272 TraceCheckUtils]: 32: Hoare triple {5990#(<= (+ |main_#t~mem13| 1) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem13 <= #t~mem14 then 1 else 0)); {6100#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:29,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {6100#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6104#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:29,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {6104#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5971#false} is VALID [2022-04-28 02:42:29,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {5971#false} assume !false; {5971#false} is VALID [2022-04-28 02:42:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 02:42:29,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:41,491 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-28 02:42:41,585 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-04-28 02:42:41,585 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 5429 treesize of output 5235 [2022-04-28 02:42:43,179 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 02:42:43,195 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-28 02:42:43,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:43,380 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.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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-28 02:42:43,389 INFO L158 Benchmark]: Toolchain (without parser) took 72740.96ms. Allocated memory was 166.7MB in the beginning and 241.2MB in the end (delta: 74.4MB). Free memory was 115.5MB in the beginning and 204.3MB in the end (delta: -88.8MB). Peak memory consumption was 120.0MB. Max. memory is 8.0GB. [2022-04-28 02:42:43,389 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 166.7MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:42:43,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.85ms. Allocated memory is still 166.7MB. Free memory was 115.2MB in the beginning and 142.4MB in the end (delta: -27.2MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-28 02:42:43,389 INFO L158 Benchmark]: Boogie Preprocessor took 55.91ms. Allocated memory is still 166.7MB. Free memory was 142.4MB in the beginning and 140.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:42:43,389 INFO L158 Benchmark]: RCFGBuilder took 287.62ms. Allocated memory is still 166.7MB. Free memory was 140.4MB in the beginning and 127.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 02:42:43,389 INFO L158 Benchmark]: TraceAbstraction took 72129.85ms. Allocated memory was 166.7MB in the beginning and 241.2MB in the end (delta: 74.4MB). Free memory was 127.3MB in the beginning and 204.3MB in the end (delta: -77.0MB). Peak memory consumption was 132.1MB. Max. memory is 8.0GB. [2022-04-28 02:42:43,390 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 166.7MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.85ms. Allocated memory is still 166.7MB. Free memory was 115.2MB in the beginning and 142.4MB in the end (delta: -27.2MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.91ms. Allocated memory is still 166.7MB. Free memory was 142.4MB in the beginning and 140.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 287.62ms. Allocated memory is still 166.7MB. Free memory was 140.4MB in the beginning and 127.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 72129.85ms. Allocated memory was 166.7MB in the beginning and 241.2MB in the end (delta: 74.4MB). Free memory was 127.3MB in the beginning and 204.3MB in the end (delta: -77.0MB). Peak memory consumption was 132.1MB. 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-28 02:42:43,439 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...