/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/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:41:51,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:41:51,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:41:51,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:41:51,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:41:51,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:41:51,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:41:51,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:41:51,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:41:51,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:41:51,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:41:51,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:41:51,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:41:51,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:41:51,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:41:51,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:41:51,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:41:51,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:41:51,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:41:51,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:41:51,707 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:41:51,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:41:51,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:41:51,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:41:51,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:41:51,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:41:51,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:41:51,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:41:51,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:41:51,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:41:51,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:41:51,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:41:51,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:41:51,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:41:51,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:41:51,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:41:51,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:41:51,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:41:51,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:41:51,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:41:51,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:41:51,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:41:51,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:41:51,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:41:51,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:41:51,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:41:51,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:41:51,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:41:51,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:41:51,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:41:51,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:41:51,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:41:51,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:41:51,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:51,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:41:51,759 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:41:51,760 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:41:51,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:41:51,760 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:41:51,760 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-15 05:41:51,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:41:51,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:41:51,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:41:51,981 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:41:51,983 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:41:51,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2022-04-15 05:41:52,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490e4256f/bd159cba7735402dac31e9c6c73eb6cb/FLAG5f9444496 [2022-04-15 05:41:52,387 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:41:52,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2022-04-15 05:41:52,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490e4256f/bd159cba7735402dac31e9c6c73eb6cb/FLAG5f9444496 [2022-04-15 05:41:52,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490e4256f/bd159cba7735402dac31e9c6c73eb6cb [2022-04-15 05:41:52,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:41:52,412 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:41:52,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:52,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:41:52,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:41:52,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f3d60b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52, skipping insertion in model container [2022-04-15 05:41:52,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:41:52,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:41:52,543 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/linear_search.c[383,396] [2022-04-15 05:41:52,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:52,570 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:41:52,582 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/linear_search.c[383,396] [2022-04-15 05:41:52,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:41:52,596 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:41:52,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52 WrapperNode [2022-04-15 05:41:52,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:41:52,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:41:52,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:41:52,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:41:52,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:41:52,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:41:52,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:41:52,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:41:52,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52" (1/1) ... [2022-04-15 05:41:52,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:41:52,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:41:52,668 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-15 05:41:52,675 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-15 05:41:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:41:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:41:52,695 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:41:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:41:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-15 05:41:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:41:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 05:41:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:41:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:41:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:41:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:41:52,698 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 05:41:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:41:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 05:41:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-15 05:41:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:41:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:41:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 05:41:52,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 05:41:52,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:41:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:41:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:41:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:41:52,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:41:52,753 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:41:52,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:41:55,001 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:41:55,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:41:55,007 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:41:55,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:55 BoogieIcfgContainer [2022-04-15 05:41:55,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:41:55,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:41:55,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:41:55,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:41:55,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:41:52" (1/3) ... [2022-04-15 05:41:55,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1abe16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:55, skipping insertion in model container [2022-04-15 05:41:55,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:52" (2/3) ... [2022-04-15 05:41:55,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1abe16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:55, skipping insertion in model container [2022-04-15 05:41:55,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:55" (3/3) ... [2022-04-15 05:41:55,013 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.c [2022-04-15 05:41:55,017 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:41:55,017 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:41:55,047 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:41:55,052 INFO L340 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 [2022-04-15 05:41:55,052 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:41:55,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 05:41:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:41:55,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:55,070 INFO L499 BasicCegarLoop]: 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-15 05:41:55,071 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 1 times [2022-04-15 05:41:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [129643218] [2022-04-15 05:41:55,088 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 2 times [2022-04-15 05:41:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:55,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576421195] [2022-04-15 05:41:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {37#true} is VALID [2022-04-15 05:41:55,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 05:41:55,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID [2022-04-15 05:41:55,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 05:41:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {37#true} is VALID [2022-04-15 05:41:55,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 05:41:55,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID [2022-04-15 05:41:55,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 05:41:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:55,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {37#true} is VALID [2022-04-15 05:41:55,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume !true; {38#false} is VALID [2022-04-15 05:41:55,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID [2022-04-15 05:41:55,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 05:41:55,408 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID [2022-04-15 05:41:55,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:55,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {37#true} is VALID [2022-04-15 05:41:55,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 05:41:55,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID [2022-04-15 05:41:55,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID [2022-04-15 05:41:55,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {37#true} is VALID [2022-04-15 05:41:55,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {37#true} is VALID [2022-04-15 05:41:55,413 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {51#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 05:41:55,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {37#true} is VALID [2022-04-15 05:41:55,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 05:41:55,413 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID [2022-04-15 05:41:55,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {37#true} is VALID [2022-04-15 05:41:55,414 INFO L272 TraceCheckUtils]: 12: Hoare triple {37#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {37#true} is VALID [2022-04-15 05:41:55,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {37#true} is VALID [2022-04-15 05:41:55,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume !true; {38#false} is VALID [2022-04-15 05:41:55,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID [2022-04-15 05:41:55,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 05:41:55,415 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID [2022-04-15 05:41:55,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {38#false} is VALID [2022-04-15 05:41:55,416 INFO L272 TraceCheckUtils]: 19: Hoare triple {38#false} call __VERIFIER_assert(#t~ret9); {38#false} is VALID [2022-04-15 05:41:55,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-15 05:41:55,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-15 05:41:55,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-15 05:41:55,418 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-15 05:41:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:55,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576421195] [2022-04-15 05:41:55,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576421195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:55,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:55,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:55,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:55,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [129643218] [2022-04-15 05:41:55,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [129643218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:55,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:55,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:41:55,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683455760] [2022-04-15 05:41:55,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 05:41:55,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:55,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:55,471 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-15 05:41:55,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:41:55,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:41:55,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:41:55,494 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,724 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-15 05:41:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:41:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 05:41:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-15 05:41:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-15 05:41:55,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-15 05:41:55,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:55,841 INFO L225 Difference]: With dead ends: 52 [2022-04-15 05:41:55,841 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 05:41:55,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 05:41:55,847 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:55,860 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:41:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 05:41:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 05:41:55,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:55,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:55,897 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:55,897 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,901 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 05:41:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 05:41:55,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:55,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:55,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 05:41:55,904 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 05:41:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:55,906 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 05:41:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 05:41:55,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:55,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:55,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:55,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 05:41:55,918 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-15 05:41:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:55,918 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 05:41:55,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:55,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 05:41:55,948 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-15 05:41:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 05:41:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:41:55,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:55,950 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-15 05:41:55,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:41:55,953 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 1 times [2022-04-15 05:41:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:55,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849156403] [2022-04-15 05:41:55,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 2 times [2022-04-15 05:41:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:55,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053194655] [2022-04-15 05:41:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:55,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {269#true} is VALID [2022-04-15 05:41:56,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-15 05:41:56,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #72#return; {269#true} is VALID [2022-04-15 05:41:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 05:41:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {269#true} is VALID [2022-04-15 05:41:56,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-15 05:41:56,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #66#return; {269#true} is VALID [2022-04-15 05:41:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 05:41:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {269#true} is VALID [2022-04-15 05:41:56,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {269#true} is VALID [2022-04-15 05:41:56,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {269#true} is VALID [2022-04-15 05:41:56,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {269#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {269#true} is VALID [2022-04-15 05:41:56,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {269#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 05:41:56,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 05:41:56,168 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {269#true} #68#return; {284#(= |main_#t~ret9| 1)} is VALID [2022-04-15 05:41:56,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {287#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:56,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {269#true} is VALID [2022-04-15 05:41:56,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-15 05:41:56,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #72#return; {269#true} is VALID [2022-04-15 05:41:56,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret10 := main(); {269#true} is VALID [2022-04-15 05:41:56,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {269#true} is VALID [2022-04-15 05:41:56,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {269#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {269#true} is VALID [2022-04-15 05:41:56,174 INFO L272 TraceCheckUtils]: 7: Hoare triple {269#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {288#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 05:41:56,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {269#true} is VALID [2022-04-15 05:41:56,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-15 05:41:56,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#true} {269#true} #66#return; {269#true} is VALID [2022-04-15 05:41:56,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {269#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {269#true} is VALID [2022-04-15 05:41:56,176 INFO L272 TraceCheckUtils]: 12: Hoare triple {269#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {269#true} is VALID [2022-04-15 05:41:56,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {269#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {269#true} is VALID [2022-04-15 05:41:56,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {269#true} is VALID [2022-04-15 05:41:56,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {269#true} is VALID [2022-04-15 05:41:56,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {269#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {269#true} is VALID [2022-04-15 05:41:56,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {269#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 05:41:56,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 05:41:56,179 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {269#true} #68#return; {284#(= |main_#t~ret9| 1)} is VALID [2022-04-15 05:41:56,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {284#(= |main_#t~ret9| 1)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {284#(= |main_#t~ret9| 1)} is VALID [2022-04-15 05:41:56,180 INFO L272 TraceCheckUtils]: 21: Hoare triple {284#(= |main_#t~ret9| 1)} call __VERIFIER_assert(#t~ret9); {285#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-15 05:41:56,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {286#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-15 05:41:56,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {270#false} is VALID [2022-04-15 05:41:56,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-15 05:41:56,182 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-15 05:41:56,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:56,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053194655] [2022-04-15 05:41:56,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053194655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:56,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:56,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:41:56,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:56,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849156403] [2022-04-15 05:41:56,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849156403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:56,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:56,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:41:56,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527869953] [2022-04-15 05:41:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:56,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 05:41:56,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:56,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:56,219 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-15 05:41:56,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:41:56,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:41:56,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:41:56,221 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,674 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 05:41:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:41:56,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 05:41:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:41:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 05:41:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 05:41:56,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-15 05:41:56,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:56,714 INFO L225 Difference]: With dead ends: 35 [2022-04-15 05:41:56,714 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 05:41:56,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:41:56,715 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:41:56,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:41:56,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 05:41:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 05:41:56,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:41:56,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:56,719 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:56,720 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,721 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 05:41:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 05:41:56,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 05:41:56,722 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 05:41:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:41:56,723 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 05:41:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 05:41:56,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:41:56,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:41:56,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:41:56,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:41:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:41:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 05:41:56,724 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-04-15 05:41:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:41:56,724 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 05:41:56,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 05:41:56,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 05:41:56,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:41:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 05:41:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 05:41:56,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:41:56,749 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-15 05:41:56,749 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:41:56,749 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:41:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:41:56,750 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 1 times [2022-04-15 05:41:56,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573520505] [2022-04-15 05:41:56,750 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:41:56,750 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 2 times [2022-04-15 05:41:56,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:41:56,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93507439] [2022-04-15 05:41:56,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:41:56,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:41:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:41:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {479#true} is VALID [2022-04-15 05:41:56,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID [2022-04-15 05:41:56,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {479#true} {479#true} #72#return; {479#true} is VALID [2022-04-15 05:41:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 05:41:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {496#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {479#true} is VALID [2022-04-15 05:41:56,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID [2022-04-15 05:41:56,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {479#true} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 05:41:56,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 05:41:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:41:56,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:56,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-15 05:41:56,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:56,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:56,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 05:41:56,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 05:41:56,952 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {480#false} is VALID [2022-04-15 05:41:56,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {479#true} call ULTIMATE.init(); {495#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:41:56,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {479#true} is VALID [2022-04-15 05:41:56,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {479#true} assume true; {479#true} is VALID [2022-04-15 05:41:56,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {479#true} {479#true} #72#return; {479#true} is VALID [2022-04-15 05:41:56,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {479#true} call #t~ret10 := main(); {479#true} is VALID [2022-04-15 05:41:56,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {479#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {479#true} is VALID [2022-04-15 05:41:56,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {479#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 05:41:56,955 INFO L272 TraceCheckUtils]: 7: Hoare triple {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {496#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 05:41:56,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {496#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {479#true} is VALID [2022-04-15 05:41:56,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {479#true} assume true; {479#true} is VALID [2022-04-15 05:41:56,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {479#true} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 05:41:56,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 05:41:56,957 INFO L272 TraceCheckUtils]: 12: Hoare triple {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {479#true} is VALID [2022-04-15 05:41:56,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {479#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:56,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-15 05:41:56,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:56,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 05:41:56,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 05:41:56,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 05:41:56,963 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {480#false} is VALID [2022-04-15 05:41:56,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {480#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {480#false} is VALID [2022-04-15 05:41:56,964 INFO L272 TraceCheckUtils]: 21: Hoare triple {480#false} call __VERIFIER_assert(#t~ret9); {480#false} is VALID [2022-04-15 05:41:56,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {480#false} ~cond := #in~cond; {480#false} is VALID [2022-04-15 05:41:56,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {480#false} assume 0 == ~cond; {480#false} is VALID [2022-04-15 05:41:56,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {480#false} assume !false; {480#false} is VALID [2022-04-15 05:41:56,964 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-15 05:41:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:41:56,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93507439] [2022-04-15 05:41:56,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93507439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:56,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:56,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:41:56,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:41:56,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573520505] [2022-04-15 05:41:56,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573520505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:41:56,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:41:56,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:41:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997914303] [2022-04-15 05:41:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:41:56,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 05:41:56,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:41:56,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 05:41:56,988 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-15 05:41:56,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:41:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:41:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:41:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:41:56,989 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 05:42:01,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 05:42:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:01,885 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 05:42:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 05:42:01,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 05:42:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 05:42:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-15 05:42:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 05:42:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-15 05:42:01,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-04-15 05:42:01,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:42:01,936 INFO L225 Difference]: With dead ends: 40 [2022-04-15 05:42:01,936 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 05:42:01,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:42:01,937 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:42:01,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 05:42:01,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 05:42:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-15 05:42:01,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:01,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:01,969 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:01,969 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:01,971 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 05:42:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-15 05:42:01,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:01,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:01,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 05:42:01,971 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 05:42:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:01,973 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 05:42:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-15 05:42:01,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:01,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:01,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:01,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:42:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-15 05:42:01,974 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-04-15 05:42:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:01,974 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-15 05:42:01,975 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 05:42:01,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-15 05:42:02,009 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-15 05:42:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 05:42:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:42:02,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:02,010 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1] [2022-04-15 05:42:02,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:42:02,010 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:02,011 INFO L85 PathProgramCache]: Analyzing trace with hash 33102019, now seen corresponding path program 1 times [2022-04-15 05:42:02,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:02,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1353596990] [2022-04-15 05:42:02,512 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:02,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:02,954 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:42:02,955 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:42:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1938157139, now seen corresponding path program 1 times [2022-04-15 05:42:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:02,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516004807] [2022-04-15 05:42:02,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:02,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {744#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {721#true} is VALID [2022-04-15 05:42:03,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {721#true} assume true; {721#true} is VALID [2022-04-15 05:42:03,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {721#true} {721#true} #72#return; {721#true} is VALID [2022-04-15 05:42:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 05:42:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {746#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 05:42:03,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {746#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {746#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 05:42:03,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {746#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {726#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} #66#return; {730#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc8.base|)) (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} is VALID [2022-04-15 05:42:03,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 05:42:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:03,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {721#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:03,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [76] L19-2-->L17-1_primed: Formula: (let ((.cse6 (mod v_linear_search_~j~0_13 4294967296))) (let ((.cse0 (= v_linear_search_~j~0_13 v_linear_search_~j~0_11)) (.cse1 (= |v_linear_search_#t~post6_4| |v_linear_search_#t~post6_3|)) (.cse2 (= |v_linear_search_#t~mem4_6| |v_linear_search_#t~mem4_4|)) (.cse5 (= (mod (+ v_linear_search_~j~0_13 1) 4294967296) 20)) (.cse3 (< .cse6 (mod v_linear_search_~n_3 4294967296))) (.cse4 (= (select (select |v_#memory_int_11| v_linear_search_~a.base_3) (+ (* .cse6 4) v_linear_search_~a.offset_3)) v_linear_search_~q_3))) (or (and .cse0 (= v_linear_search_~q_3 v_linear_search_~q_3) (= v_linear_search_~n_3 v_linear_search_~n_3) (= v_linear_search_~a.offset_3 v_linear_search_~a.offset_3) .cse1 (= v_linear_search_~a.base_3 v_linear_search_~a.base_3) (= |v_linear_search_#t~short5_24| |v_linear_search_#t~short5_9|) .cse2 (= |v_#memory_int_11| |v_#memory_int_11|)) (and (or (and |v_linear_search_#t~short5_24| |v_linear_search_#t~short5_9|) (and (not |v_linear_search_#t~short5_9|) (not |v_linear_search_#t~short5_24|))) .cse0 (or (not .cse3) .cse4 (not .cse5)) .cse1 .cse2) (and .cse5 .cse3 (= (+ v_linear_search_~j~0_11 1) 0) (not .cse4))))) InVars {linear_search_~a.base=v_linear_search_~a.base_3, linear_search_~n=v_linear_search_~n_3, linear_search_#t~short5=|v_linear_search_#t~short5_24|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_4|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_13, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_6|} OutVars{linear_search_~a.base=v_linear_search_~a.base_3, linear_search_~n=v_linear_search_~n_3, linear_search_#t~short5=|v_linear_search_#t~short5_9|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_3|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_11, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_4|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:03,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [77] L17-1_primed-->L19-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:03,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [78] L19-2-->L17-1_primed: Formula: (let ((.cse8 (mod v_linear_search_~j~0_13 4294967296))) (let ((.cse6 (select |v_#memory_int_11| v_linear_search_~a.base_3)) (.cse7 (* .cse8 4))) (let ((.cse0 (= v_linear_search_~j~0_13 v_linear_search_~j~0_11)) (.cse1 (= |v_linear_search_#t~post6_7| |v_linear_search_#t~post6_3|)) (.cse5 (= (mod (+ v_linear_search_~j~0_13 1) 4294967296) 20)) (.cse2 (< .cse8 (mod v_linear_search_~n_3 4294967296))) (.cse4 (= (select .cse6 (+ (- 17179869184) .cse7 v_linear_search_~a.offset_3)) v_linear_search_~q_3)) (.cse3 (= (select .cse6 (+ .cse7 v_linear_search_~a.offset_3)) v_linear_search_~q_3))) (or (and .cse0 (= v_linear_search_~q_3 v_linear_search_~q_3) (= |v_linear_search_#t~short5_31| |v_linear_search_#t~short5_9|) (= v_linear_search_~n_3 v_linear_search_~n_3) .cse1 (= |v_linear_search_#t~mem4_9| |v_linear_search_#t~mem4_4|) (= v_linear_search_~a.offset_3 v_linear_search_~a.offset_3) (= v_linear_search_~a.base_3 v_linear_search_~a.base_3) (= |v_#memory_int_11| |v_#memory_int_11|)) (and (= |v_linear_search_#t~mem4_4| |v_linear_search_#t~mem4_9|) .cse0 .cse1 (or (not .cse2) .cse3 .cse4 (not .cse5)) (or (and |v_linear_search_#t~short5_31| |v_linear_search_#t~short5_9|) (and (not |v_linear_search_#t~short5_31|) (not |v_linear_search_#t~short5_9|)))) (and .cse5 .cse2 (= v_linear_search_~j~0_11 (- 1)) (not .cse4) (not .cse3)))))) InVars {linear_search_~a.base=v_linear_search_~a.base_3, linear_search_~n=v_linear_search_~n_3, linear_search_#t~short5=|v_linear_search_#t~short5_31|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_7|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_13, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_9|} OutVars{linear_search_~a.base=v_linear_search_~a.base_3, linear_search_~n=v_linear_search_~n_3, linear_search_#t~short5=|v_linear_search_#t~short5_9|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_3|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_11, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_4|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:03,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [79] L17-1_primed-->L19-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:03,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [80] L19-2-->L17-1_primed: Formula: (let ((.cse0 (= v_linear_search_~j~0_13 v_linear_search_~j~0_11))) (or (and (= |v_linear_search_#t~post6_10| |v_linear_search_#t~post6_3|) .cse0 (= |v_linear_search_#t~mem4_12| |v_linear_search_#t~mem4_4|) (= |v_linear_search_#t~short5_38| |v_linear_search_#t~short5_9|)) (and (= |v_linear_search_#t~mem4_4| |v_linear_search_#t~mem4_12|) .cse0 (or (and (not |v_linear_search_#t~short5_38|) (not |v_linear_search_#t~short5_9|)) (and |v_linear_search_#t~short5_38| |v_linear_search_#t~short5_9|)) (= |v_linear_search_#t~post6_3| |v_linear_search_#t~post6_10|)))) InVars {linear_search_~j~0=v_linear_search_~j~0_13, linear_search_#t~short5=|v_linear_search_#t~short5_38|, linear_search_#t~post6=|v_linear_search_#t~post6_10|, linear_search_#t~mem4=|v_linear_search_#t~mem4_12|} OutVars{linear_search_~j~0=v_linear_search_~j~0_11, linear_search_#t~short5=|v_linear_search_#t~short5_9|, linear_search_#t~post6=|v_linear_search_#t~post6_3|, linear_search_#t~mem4=|v_linear_search_#t~mem4_4|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {748#(and (or (and (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)) (= |linear_search_#in~a.base| linear_search_~a.base) (and (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (and (or (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)))) (= |linear_search_#in~q| linear_search_~q)) (= |linear_search_#in~a.offset| linear_search_~a.offset))} is VALID [2022-04-15 05:42:03,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {748#(and (or (and (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)) (= |linear_search_#in~a.base| linear_search_~a.base) (and (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (and (or (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)))) (= |linear_search_#in~q| linear_search_~q)) (= |linear_search_#in~a.offset| linear_search_~a.offset))} [75] L17-1_primed-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_#t~short5=|v_linear_search_#t~short5_5|, linear_search_~j~0=v_linear_search_~j~0_6} AuxVars[] AssignedVars[linear_search_#t~short5] {749#(and (or (and (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)) (= |linear_search_#in~a.base| linear_search_~a.base) (and (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (and (or (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)))) (= |linear_search_#in~q| linear_search_~q)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (or (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967294)) (not |linear_search_#t~short5|)))} is VALID [2022-04-15 05:42:03,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {749#(and (or (and (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)) (= |linear_search_#in~a.base| linear_search_~a.base) (and (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (and (or (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)))) (= |linear_search_#in~q| linear_search_~q)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (or (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967294)) (not |linear_search_#t~short5|)))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {750#(or |linear_search_#t~short5| (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0))) (or (<= (+ (* linear_search_~j~0 4) |linear_search_#in~a.offset|) (+ (* 17179869184 (div linear_search_~j~0 4294967296)) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|))) (= |linear_search_#in~q| 0))} is VALID [2022-04-15 05:42:03,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {750#(or |linear_search_#t~short5| (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0))) (or (<= (+ (* linear_search_~j~0 4) |linear_search_#in~a.offset|) (+ (* 17179869184 (div linear_search_~j~0 4294967296)) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|))) (= |linear_search_#in~q| 0))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {751#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0))) (or (<= (+ (* linear_search_~j~0 4) |linear_search_#in~a.offset|) (+ (* 17179869184 (div linear_search_~j~0 4294967296)) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|))) (= |linear_search_#in~q| 0))} is VALID [2022-04-15 05:42:03,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {751#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0))) (or (<= (+ (* linear_search_~j~0 4) |linear_search_#in~a.offset|) (+ (* 17179869184 (div linear_search_~j~0 4294967296)) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|))) (= |linear_search_#in~q| 0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {752#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (or (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|) (<= (+ (* ~SIZE~0 4) |linear_search_#in~a.offset|) (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) (* 17179869184 (div ~SIZE~0 4294967296))))) (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (= |linear_search_#in~q| 0))} is VALID [2022-04-15 05:42:03,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {752#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (or (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|) (<= (+ (* ~SIZE~0 4) |linear_search_#in~a.offset|) (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) (* 17179869184 (div ~SIZE~0 4294967296))))) (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (= |linear_search_#in~q| 0))} assume true; {752#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (or (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|) (<= (+ (* ~SIZE~0 4) |linear_search_#in~a.offset|) (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) (* 17179869184 (div ~SIZE~0 4294967296))))) (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (= |linear_search_#in~q| 0))} is VALID [2022-04-15 05:42:03,771 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {752#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (or (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|) (<= (+ (* ~SIZE~0 4) |linear_search_#in~a.offset|) (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) (* 17179869184 (div ~SIZE~0 4294967296))))) (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (= |linear_search_#in~q| 0))} {731#(and (= ((as const (Array Int Int)) 0) (store (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) 4) (* (- 17179869184) (div (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) 4294967296))) 0)) (= main_~a~0.offset 0) (<= (+ (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0))} #68#return; {722#false} is VALID [2022-04-15 05:42:03,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {721#true} call ULTIMATE.init(); {744#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:42:03,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {744#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#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(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {721#true} is VALID [2022-04-15 05:42:03,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {721#true} assume true; {721#true} is VALID [2022-04-15 05:42:03,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {721#true} {721#true} #72#return; {721#true} is VALID [2022-04-15 05:42:03,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {721#true} call #t~ret10 := main(); {721#true} is VALID [2022-04-15 05:42:03,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {721#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {721#true} is VALID [2022-04-15 05:42:03,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {721#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {726#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} is VALID [2022-04-15 05:42:03,774 INFO L272 TraceCheckUtils]: 7: Hoare triple {726#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {745#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 05:42:03,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {745#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {746#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 05:42:03,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {746#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {746#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-15 05:42:03,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {746#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {726#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} #66#return; {730#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc8.base|)) (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} is VALID [2022-04-15 05:42:05,908 WARN L290 TraceCheckUtils]: 11: Hoare triple {730#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc8.base|)) (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {731#(and (= ((as const (Array Int Int)) 0) (store (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) 4) (* (- 17179869184) (div (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) 4294967296))) 0)) (= main_~a~0.offset 0) (<= (+ (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0))} is UNKNOWN [2022-04-15 05:42:05,909 INFO L272 TraceCheckUtils]: 12: Hoare triple {731#(and (= ((as const (Array Int Int)) 0) (store (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) 4) (* (- 17179869184) (div (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) 4294967296))) 0)) (= main_~a~0.offset 0) (<= (+ (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0))} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {721#true} is VALID [2022-04-15 05:42:05,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {721#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:05,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [76] L19-2-->L17-1_primed: Formula: (let ((.cse6 (mod v_linear_search_~j~0_13 4294967296))) (let ((.cse0 (= v_linear_search_~j~0_13 v_linear_search_~j~0_11)) (.cse1 (= |v_linear_search_#t~post6_4| |v_linear_search_#t~post6_3|)) (.cse2 (= |v_linear_search_#t~mem4_6| |v_linear_search_#t~mem4_4|)) (.cse5 (= (mod (+ v_linear_search_~j~0_13 1) 4294967296) 20)) (.cse3 (< .cse6 (mod v_linear_search_~n_3 4294967296))) (.cse4 (= (select (select |v_#memory_int_11| v_linear_search_~a.base_3) (+ (* .cse6 4) v_linear_search_~a.offset_3)) v_linear_search_~q_3))) (or (and .cse0 (= v_linear_search_~q_3 v_linear_search_~q_3) (= v_linear_search_~n_3 v_linear_search_~n_3) (= v_linear_search_~a.offset_3 v_linear_search_~a.offset_3) .cse1 (= v_linear_search_~a.base_3 v_linear_search_~a.base_3) (= |v_linear_search_#t~short5_24| |v_linear_search_#t~short5_9|) .cse2 (= |v_#memory_int_11| |v_#memory_int_11|)) (and (or (and |v_linear_search_#t~short5_24| |v_linear_search_#t~short5_9|) (and (not |v_linear_search_#t~short5_9|) (not |v_linear_search_#t~short5_24|))) .cse0 (or (not .cse3) .cse4 (not .cse5)) .cse1 .cse2) (and .cse5 .cse3 (= (+ v_linear_search_~j~0_11 1) 0) (not .cse4))))) InVars {linear_search_~a.base=v_linear_search_~a.base_3, linear_search_~n=v_linear_search_~n_3, linear_search_#t~short5=|v_linear_search_#t~short5_24|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_4|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_13, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_6|} OutVars{linear_search_~a.base=v_linear_search_~a.base_3, linear_search_~n=v_linear_search_~n_3, linear_search_#t~short5=|v_linear_search_#t~short5_9|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_3|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_11, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_4|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:05,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [77] L17-1_primed-->L19-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:05,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [78] L19-2-->L17-1_primed: Formula: (let ((.cse8 (mod v_linear_search_~j~0_13 4294967296))) (let ((.cse6 (select |v_#memory_int_11| v_linear_search_~a.base_3)) (.cse7 (* .cse8 4))) (let ((.cse0 (= v_linear_search_~j~0_13 v_linear_search_~j~0_11)) (.cse1 (= |v_linear_search_#t~post6_7| |v_linear_search_#t~post6_3|)) (.cse5 (= (mod (+ v_linear_search_~j~0_13 1) 4294967296) 20)) (.cse2 (< .cse8 (mod v_linear_search_~n_3 4294967296))) (.cse4 (= (select .cse6 (+ (- 17179869184) .cse7 v_linear_search_~a.offset_3)) v_linear_search_~q_3)) (.cse3 (= (select .cse6 (+ .cse7 v_linear_search_~a.offset_3)) v_linear_search_~q_3))) (or (and .cse0 (= v_linear_search_~q_3 v_linear_search_~q_3) (= |v_linear_search_#t~short5_31| |v_linear_search_#t~short5_9|) (= v_linear_search_~n_3 v_linear_search_~n_3) .cse1 (= |v_linear_search_#t~mem4_9| |v_linear_search_#t~mem4_4|) (= v_linear_search_~a.offset_3 v_linear_search_~a.offset_3) (= v_linear_search_~a.base_3 v_linear_search_~a.base_3) (= |v_#memory_int_11| |v_#memory_int_11|)) (and (= |v_linear_search_#t~mem4_4| |v_linear_search_#t~mem4_9|) .cse0 .cse1 (or (not .cse2) .cse3 .cse4 (not .cse5)) (or (and |v_linear_search_#t~short5_31| |v_linear_search_#t~short5_9|) (and (not |v_linear_search_#t~short5_31|) (not |v_linear_search_#t~short5_9|)))) (and .cse5 .cse2 (= v_linear_search_~j~0_11 (- 1)) (not .cse4) (not .cse3)))))) InVars {linear_search_~a.base=v_linear_search_~a.base_3, linear_search_~n=v_linear_search_~n_3, linear_search_#t~short5=|v_linear_search_#t~short5_31|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_7|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_13, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_9|} OutVars{linear_search_~a.base=v_linear_search_~a.base_3, linear_search_~n=v_linear_search_~n_3, linear_search_#t~short5=|v_linear_search_#t~short5_9|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_3|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_11, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_4|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:05,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [79] L17-1_primed-->L19-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} is VALID [2022-04-15 05:42:05,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {747#(and (= |linear_search_#in~a.offset| linear_search_~a.offset) (= |linear_search_#in~a.base| linear_search_~a.base) (= |linear_search_#in~q| linear_search_~q))} [80] L19-2-->L17-1_primed: Formula: (let ((.cse0 (= v_linear_search_~j~0_13 v_linear_search_~j~0_11))) (or (and (= |v_linear_search_#t~post6_10| |v_linear_search_#t~post6_3|) .cse0 (= |v_linear_search_#t~mem4_12| |v_linear_search_#t~mem4_4|) (= |v_linear_search_#t~short5_38| |v_linear_search_#t~short5_9|)) (and (= |v_linear_search_#t~mem4_4| |v_linear_search_#t~mem4_12|) .cse0 (or (and (not |v_linear_search_#t~short5_38|) (not |v_linear_search_#t~short5_9|)) (and |v_linear_search_#t~short5_38| |v_linear_search_#t~short5_9|)) (= |v_linear_search_#t~post6_3| |v_linear_search_#t~post6_10|)))) InVars {linear_search_~j~0=v_linear_search_~j~0_13, linear_search_#t~short5=|v_linear_search_#t~short5_38|, linear_search_#t~post6=|v_linear_search_#t~post6_10|, linear_search_#t~mem4=|v_linear_search_#t~mem4_12|} OutVars{linear_search_~j~0=v_linear_search_~j~0_11, linear_search_#t~short5=|v_linear_search_#t~short5_9|, linear_search_#t~post6=|v_linear_search_#t~post6_3|, linear_search_#t~mem4=|v_linear_search_#t~mem4_4|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {748#(and (or (and (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)) (= |linear_search_#in~a.base| linear_search_~a.base) (and (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (and (or (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)))) (= |linear_search_#in~q| linear_search_~q)) (= |linear_search_#in~a.offset| linear_search_~a.offset))} is VALID [2022-04-15 05:42:05,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {748#(and (or (and (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)) (= |linear_search_#in~a.base| linear_search_~a.base) (and (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (and (or (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)))) (= |linear_search_#in~q| linear_search_~q)) (= |linear_search_#in~a.offset| linear_search_~a.offset))} [75] L17-1_primed-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_#t~short5=|v_linear_search_#t~short5_5|, linear_search_~j~0=v_linear_search_~j~0_6} AuxVars[] AssignedVars[linear_search_#t~short5] {749#(and (or (and (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)) (= |linear_search_#in~a.base| linear_search_~a.base) (and (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (and (or (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)))) (= |linear_search_#in~q| linear_search_~q)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (or (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967294)) (not |linear_search_#t~short5|)))} is VALID [2022-04-15 05:42:05,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {749#(and (or (and (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)) (= |linear_search_#in~a.base| linear_search_~a.base) (and (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (and (or (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296)))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) (- 17179869184) linear_search_~a.offset)) 0))) (or (not (<= linear_search_~j~0 (+ 2147483647 (* 4294967296 (div linear_search_~j~0 4294967296))))) (not (= (select (select |#memory_int| linear_search_~a.base) (+ (* (- 17179869184) (div linear_search_~j~0 4294967296)) (* linear_search_~j~0 4) linear_search_~a.offset)) 0)))) (= |linear_search_#in~q| linear_search_~q)) (= |linear_search_#in~a.offset| linear_search_~a.offset) (or (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967294)) (not |linear_search_#t~short5|)))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {750#(or |linear_search_#t~short5| (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0))) (or (<= (+ (* linear_search_~j~0 4) |linear_search_#in~a.offset|) (+ (* 17179869184 (div linear_search_~j~0 4294967296)) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|))) (= |linear_search_#in~q| 0))} is VALID [2022-04-15 05:42:05,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {750#(or |linear_search_#t~short5| (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0))) (or (<= (+ (* linear_search_~j~0 4) |linear_search_#in~a.offset|) (+ (* 17179869184 (div linear_search_~j~0 4294967296)) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|))) (= |linear_search_#in~q| 0))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {751#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0))) (or (<= (+ (* linear_search_~j~0 4) |linear_search_#in~a.offset|) (+ (* 17179869184 (div linear_search_~j~0 4294967296)) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|))) (= |linear_search_#in~q| 0))} is VALID [2022-04-15 05:42:05,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {751#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0))) (or (<= (+ (* linear_search_~j~0 4) |linear_search_#in~a.offset|) (+ (* 17179869184 (div linear_search_~j~0 4294967296)) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|))) (= |linear_search_#in~q| 0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {752#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (or (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|) (<= (+ (* ~SIZE~0 4) |linear_search_#in~a.offset|) (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) (* 17179869184 (div ~SIZE~0 4294967296))))) (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (= |linear_search_#in~q| 0))} is VALID [2022-04-15 05:42:05,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {752#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (or (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|) (<= (+ (* ~SIZE~0 4) |linear_search_#in~a.offset|) (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) (* 17179869184 (div ~SIZE~0 4294967296))))) (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (= |linear_search_#in~q| 0))} assume true; {752#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (or (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|) (<= (+ (* ~SIZE~0 4) |linear_search_#in~a.offset|) (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) (* 17179869184 (div ~SIZE~0 4294967296))))) (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (= |linear_search_#in~q| 0))} is VALID [2022-04-15 05:42:05,934 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {752#(or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |linear_search_#in~a.base|) (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (and (or (<= (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) 8) |linear_search_#in~a.offset|) (<= (+ (* ~SIZE~0 4) |linear_search_#in~a.offset|) (+ (@diff (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)) (* 17179869184 (div ~SIZE~0 4294967296))))) (not (= (select |#memory_int| |linear_search_#in~a.base|) ((as const (Array Int Int)) 0)))) (= |linear_search_#in~q| 0))} {731#(and (= ((as const (Array Int Int)) 0) (store (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) 4) (* (- 17179869184) (div (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) 4294967296))) 0)) (= main_~a~0.offset 0) (<= (+ (div (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296))) 2) (* (div ~SIZE~0 4294967296) 4294967296) 1) ~SIZE~0))} #68#return; {722#false} is VALID [2022-04-15 05:42:05,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {722#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {722#false} is VALID [2022-04-15 05:42:05,934 INFO L272 TraceCheckUtils]: 26: Hoare triple {722#false} call __VERIFIER_assert(#t~ret9); {722#false} is VALID [2022-04-15 05:42:05,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {722#false} ~cond := #in~cond; {722#false} is VALID [2022-04-15 05:42:05,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {722#false} assume 0 == ~cond; {722#false} is VALID [2022-04-15 05:42:05,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {722#false} assume !false; {722#false} is VALID [2022-04-15 05:42:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:42:05,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:05,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516004807] [2022-04-15 05:42:05,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516004807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:05,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929824475] [2022-04-15 05:42:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:05,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:05,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:05,952 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-15 05:42:05,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process