/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_sea.ch.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:41:34,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:41:34,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:41:34,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:41:34,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:41:34,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:41:34,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:41:34,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:41:34,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:41:34,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:41:34,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:41:34,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:41:34,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:41:34,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:41:34,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:41:34,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:41:34,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:41:34,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:41:34,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:41:34,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:41:34,676 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:41:34,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:41:34,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:41:34,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:41:34,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:41:34,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:41:34,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:41:34,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:41:34,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:41:34,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:41:34,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:41:34,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:41:34,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:41:34,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:41:34,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:41:34,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:41:34,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:41:34,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:41:34,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:41:34,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:41:34,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:41:34,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:41:34,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:41:34,699 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:41:34,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:41:34,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:41:34,701 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:41:34,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:41:34,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:41:34,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:41:34,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:41:34,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:41:34,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:41:34,702 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:41:34,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:41:34,702 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:41:34,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:41:34,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:41:34,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:41:34,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:41:34,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:41:34,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:34,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:41:34,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:41:34,704 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:41:34,704 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:41:34,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:41:34,704 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:41:34,705 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:41:34,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:41:34,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:41:34,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:41:34,962 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:41:34,965 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:41:34,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch.c [2022-04-28 02:41:35,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddeb4458/536301b7a5534fd7b1838bf86a0469e3/FLAGa4e662d3f [2022-04-28 02:41:35,456 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:41:35,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c [2022-04-28 02:41:35,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddeb4458/536301b7a5534fd7b1838bf86a0469e3/FLAGa4e662d3f [2022-04-28 02:41:35,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddeb4458/536301b7a5534fd7b1838bf86a0469e3 [2022-04-28 02:41:35,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:41:35,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:41:35,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:35,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:41:35,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:41:35,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7a286b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35, skipping insertion in model container [2022-04-28 02:41:35,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:41:35,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:41:35,687 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_sea.ch.c[383,396] [2022-04-28 02:41:35,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:35,713 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:41:35,723 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_sea.ch.c[383,396] [2022-04-28 02:41:35,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:35,742 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:41:35,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35 WrapperNode [2022-04-28 02:41:35,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:35,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:41:35,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:41:35,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:41:35,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:41:35,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:41:35,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:41:35,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:41:35,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35" (1/1) ... [2022-04-28 02:41:35,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:35,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:35,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:41:35,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:41:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:41:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:41:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:41:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:41:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-28 02:41:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:41:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 02:41:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:41:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:41:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:41:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:41:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 02:41:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:41:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:41:35,961 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:41:35,963 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:41:36,171 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:41:36,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:41:36,177 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:41:36,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:36 BoogieIcfgContainer [2022-04-28 02:41:36,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:41:36,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:41:36,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:41:36,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:41:36,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:35" (1/3) ... [2022-04-28 02:41:36,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b15151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:36, skipping insertion in model container [2022-04-28 02:41:36,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:35" (2/3) ... [2022-04-28 02:41:36,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b15151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:36, skipping insertion in model container [2022-04-28 02:41:36,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:36" (3/3) ... [2022-04-28 02:41:36,192 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2022-04-28 02:41:36,205 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:41:36,206 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:41:36,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:41:36,272 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3408e65, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5529fe74 [2022-04-28 02:41:36,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:41:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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-28 02:41:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:41:36,287 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:36,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:36,288 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:36,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1307815669, now seen corresponding path program 1 times [2022-04-28 02:41:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:36,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819879912] [2022-04-28 02:41:36,314 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1307815669, now seen corresponding path program 2 times [2022-04-28 02:41:36,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:36,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559361830] [2022-04-28 02:41:36,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:36,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:36,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(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; {36#true} is VALID [2022-04-28 02:41:36,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 02:41:36,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #66#return; {36#true} is VALID [2022-04-28 02:41:36,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 02:41:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:36,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {36#true} is VALID [2022-04-28 02:41:36,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 02:41:36,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #60#return; {36#true} is VALID [2022-04-28 02:41:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 02:41:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:36,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {36#true} is VALID [2022-04-28 02:41:36,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-04-28 02:41:36,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {37#false} is VALID [2022-04-28 02:41:36,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 02:41:36,662 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37#false} {36#true} #62#return; {37#false} is VALID [2022-04-28 02:41:36,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(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-28 02:41:36,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(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; {36#true} is VALID [2022-04-28 02:41:36,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 02:41:36,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #66#return; {36#true} is VALID [2022-04-28 02:41:36,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret10 := main(); {36#true} is VALID [2022-04-28 02:41:36,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {36#true} is VALID [2022-04-28 02:41:36,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {36#true} is VALID [2022-04-28 02:41:36,673 INFO L272 TraceCheckUtils]: 7: Hoare triple {36#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {50#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 02:41:36,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {36#true} is VALID [2022-04-28 02:41:36,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 02:41:36,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#true} {36#true} #60#return; {36#true} is VALID [2022-04-28 02:41:36,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#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); {36#true} is VALID [2022-04-28 02:41:36,675 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#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); {36#true} is VALID [2022-04-28 02:41:36,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {36#true} is VALID [2022-04-28 02:41:36,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-04-28 02:41:36,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {37#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {37#false} is VALID [2022-04-28 02:41:36,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 02:41:36,678 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37#false} {36#true} #62#return; {37#false} is VALID [2022-04-28 02:41:36,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {37#false} is VALID [2022-04-28 02:41:36,678 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert(#t~ret9); {37#false} is VALID [2022-04-28 02:41:36,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-28 02:41:36,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-28 02:41:36,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-28 02:41:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:36,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559361830] [2022-04-28 02:41:36,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559361830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:36,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:36,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:36,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:36,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819879912] [2022-04-28 02:41:36,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819879912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:36,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:36,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055356140] [2022-04-28 02:41:36,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:36,690 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-28 02:41:36,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:36,696 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-28 02:41:36,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:36,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:41:36,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:36,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:41:36,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:41:36,762 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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-28 02:41:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:37,005 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-28 02:41:37,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:41:37,006 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-28 02:41:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:37,007 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-28 02:41:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-28 02:41:37,016 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-28 02:41:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-28 02:41:37,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-28 02:41:37,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:37,120 INFO L225 Difference]: With dead ends: 51 [2022-04-28 02:41:37,120 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:41:37,123 INFO L412 NwaCegarLoop]: 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-28 02:41:37,126 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 37 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-28 02:41:37,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:41:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 02:41:37,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:37,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-28 02:41:37,170 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-28 02:41:37,170 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-28 02:41:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:37,174 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 02:41:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 02:41:37,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:37,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:37,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 26 states. [2022-04-28 02:41:37,176 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 26 states. [2022-04-28 02:41:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:37,184 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 02:41:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 02:41:37,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:37,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:37,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:37,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-28 02:41:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-28 02:41:37,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-04-28 02:41:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:37,208 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-28 02:41:37,209 INFO L496 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-28 02:41:37,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-28 02:41:37,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 02:41:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:41:37,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:37,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:37,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:41:37,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1795654780, now seen corresponding path program 1 times [2022-04-28 02:41:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:37,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1183908619] [2022-04-28 02:41:37,276 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1795654780, now seen corresponding path program 2 times [2022-04-28 02:41:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:37,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913686599] [2022-04-28 02:41:37,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:37,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:37,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#(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; {262#true} is VALID [2022-04-28 02:41:37,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 02:41:37,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #66#return; {262#true} is VALID [2022-04-28 02:41:37,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 02:41:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:37,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {262#true} is VALID [2022-04-28 02:41:37,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 02:41:37,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #60#return; {262#true} is VALID [2022-04-28 02:41:37,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 02:41:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:37,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {262#true} is VALID [2022-04-28 02:41:37,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {262#true} is VALID [2022-04-28 02:41:37,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#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; {262#true} is VALID [2022-04-28 02:41:37,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {262#true} is VALID [2022-04-28 02:41:37,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {262#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-28 02:41:37,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-28 02:41:37,518 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {262#true} #62#return; {277#(= |main_#t~ret9| 1)} is VALID [2022-04-28 02:41:37,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {280#(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-28 02:41:37,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#(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; {262#true} is VALID [2022-04-28 02:41:37,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 02:41:37,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #66#return; {262#true} is VALID [2022-04-28 02:41:37,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret10 := main(); {262#true} is VALID [2022-04-28 02:41:37,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {262#true} is VALID [2022-04-28 02:41:37,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {262#true} is VALID [2022-04-28 02:41:37,521 INFO L272 TraceCheckUtils]: 7: Hoare triple {262#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {281#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 02:41:37,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {262#true} is VALID [2022-04-28 02:41:37,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 02:41:37,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {262#true} {262#true} #60#return; {262#true} is VALID [2022-04-28 02:41:37,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#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); {262#true} is VALID [2022-04-28 02:41:37,522 INFO L272 TraceCheckUtils]: 12: Hoare triple {262#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); {262#true} is VALID [2022-04-28 02:41:37,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {262#true} is VALID [2022-04-28 02:41:37,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {262#true} is VALID [2022-04-28 02:41:37,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#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; {262#true} is VALID [2022-04-28 02:41:37,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {262#true} is VALID [2022-04-28 02:41:37,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-28 02:41:37,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-28 02:41:37,526 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {262#true} #62#return; {277#(= |main_#t~ret9| 1)} is VALID [2022-04-28 02:41:37,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {277#(= |main_#t~ret9| 1)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {277#(= |main_#t~ret9| 1)} is VALID [2022-04-28 02:41:37,528 INFO L272 TraceCheckUtils]: 21: Hoare triple {277#(= |main_#t~ret9| 1)} call __VERIFIER_assert(#t~ret9); {278#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-28 02:41:37,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {278#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {279#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-28 02:41:37,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {279#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {263#false} is VALID [2022-04-28 02:41:37,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 02:41:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:37,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913686599] [2022-04-28 02:41:37,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913686599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:37,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:37,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:41:37,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:37,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1183908619] [2022-04-28 02:41:37,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1183908619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:37,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:37,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:41:37,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626135555] [2022-04-28 02:41:37,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:37,533 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-28 02:41:37,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:37,533 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-28 02:41:37,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:37,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:41:37,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:37,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:41:37,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:41:37,569 INFO L87 Difference]: Start difference. First operand 26 states and 28 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-28 02:41:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,013 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-28 02:41:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:41:38,014 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-28 02:41:38,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:38,015 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-28 02:41:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-28 02:41:38,025 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-28 02:41:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-28 02:41:38,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-28 02:41:38,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:38,078 INFO L225 Difference]: With dead ends: 34 [2022-04-28 02:41:38,078 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 02:41:38,079 INFO L412 NwaCegarLoop]: 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-28 02:41:38,080 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:38,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 45 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:41:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 02:41:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 02:41:38,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:38,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-28 02:41:38,091 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-28 02:41:38,092 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-28 02:41:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,094 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-28 02:41:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 02:41:38,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:38,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:38,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 26 states. [2022-04-28 02:41:38,095 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 26 states. [2022-04-28 02:41:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:38,097 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-28 02:41:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 02:41:38,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:38,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:38,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:38,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-28 02:41:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-28 02:41:38,100 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2022-04-28 02:41:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:38,100 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-28 02:41:38,101 INFO L496 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-28 02:41:38,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-28 02:41:38,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-28 02:41:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 02:41:38,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:38,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:38,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:41:38,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:38,136 INFO L85 PathProgramCache]: Analyzing trace with hash -52844445, now seen corresponding path program 1 times [2022-04-28 02:41:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:38,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409773288] [2022-04-28 02:41:38,137 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash -52844445, now seen corresponding path program 2 times [2022-04-28 02:41:38,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:38,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596459159] [2022-04-28 02:41:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:38,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:38,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {482#(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; {466#true} is VALID [2022-04-28 02:41:38,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 02:41:38,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #66#return; {466#true} is VALID [2022-04-28 02:41:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 02:41:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:38,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {466#true} is VALID [2022-04-28 02:41:38,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 02:41:38,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #60#return; {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-28 02:41:38,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 02:41:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:38,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:38,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {485#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-28 02:41:38,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#(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; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:38,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:38,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:38,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:38,458 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #62#return; {467#false} is VALID [2022-04-28 02:41:38,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {482#(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-28 02:41:38,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#(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; {466#true} is VALID [2022-04-28 02:41:38,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 02:41:38,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #66#return; {466#true} is VALID [2022-04-28 02:41:38,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret10 := main(); {466#true} is VALID [2022-04-28 02:41:38,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {466#true} is VALID [2022-04-28 02:41:38,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-28 02:41:38,465 INFO L272 TraceCheckUtils]: 7: Hoare triple {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {483#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 02:41:38,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {466#true} is VALID [2022-04-28 02:41:38,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-28 02:41:38,466 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {466#true} {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #60#return; {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-28 02:41:38,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(<= (+ 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); {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-28 02:41:38,467 INFO L272 TraceCheckUtils]: 12: Hoare triple {471#(<= (+ 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); {466#true} is VALID [2022-04-28 02:41:38,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:38,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {485#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-28 02:41:38,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {485#(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; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:38,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 02:41:38,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:38,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 02:41:38,476 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #62#return; {467#false} is VALID [2022-04-28 02:41:38,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {467#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {467#false} is VALID [2022-04-28 02:41:38,476 INFO L272 TraceCheckUtils]: 21: Hoare triple {467#false} call __VERIFIER_assert(#t~ret9); {467#false} is VALID [2022-04-28 02:41:38,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2022-04-28 02:41:38,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {467#false} assume 0 == ~cond; {467#false} is VALID [2022-04-28 02:41:38,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-28 02:41:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:38,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:38,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596459159] [2022-04-28 02:41:38,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596459159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:38,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:38,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:41:38,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:38,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409773288] [2022-04-28 02:41:38,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409773288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:38,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:38,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:41:38,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239841020] [2022-04-28 02:41:38,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:38,479 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-28 02:41:38,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:38,480 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-28 02:41:38,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:38,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 02:41:38,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:38,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 02:41:38,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:41:38,508 INFO L87 Difference]: Start difference. First operand 26 states and 27 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-28 02:41:42,954 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-28 02:41:43,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:43,446 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 02:41:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 02:41:43,447 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-28 02:41:43,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:43,447 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-28 02:41:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-28 02:41:43,449 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-28 02:41:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-28 02:41:43,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2022-04-28 02:41:43,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:43,511 INFO L225 Difference]: With dead ends: 39 [2022-04-28 02:41:43,511 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 02:41:43,512 INFO L412 NwaCegarLoop]: 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-28 02:41:43,513 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 60 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:43,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 29 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 02:41:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 02:41:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 02:41:43,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:43,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:41:43,565 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:41:43,565 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:41:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:43,567 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 02:41:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 02:41:43,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:43,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:43,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 30 states. [2022-04-28 02:41:43,568 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 30 states. [2022-04-28 02:41:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:43,570 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 02:41:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 02:41:43,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:43,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:43,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:43,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-28 02:41:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 02:41:43,572 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-28 02:41:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:43,572 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 02:41:43,573 INFO L496 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-28 02:41:43,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 02:41:43,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 02:41:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 02:41:43,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:43,622 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:43,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:41:43,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:43,623 INFO L85 PathProgramCache]: Analyzing trace with hash -238208460, now seen corresponding path program 1 times [2022-04-28 02:41:43,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:43,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2071047056] [2022-04-28 02:41:45,274 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:49,779 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:41:50,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:51,777 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 02:41:51,785 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:41:51,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1176959015, now seen corresponding path program 1 times [2022-04-28 02:41:51,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:51,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846142803] [2022-04-28 02:41:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:51,850 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_13 (* (- 4294967296) (div linear_search_~n_13 4294967296)) (* (- 1) linear_search_~j~0_13) (* (- 1) .v_it_1.0) (* 4294967296 (div (+ linear_search_~j~0_13 .v_it_1.0) 4294967296))) 0)) [2022-04-28 02:41:51,864 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 linear_search_~j~0_13) (* 4 .v_it_1.0) (* (- 17179869184) (div (+ linear_search_~j~0_13 .v_it_1.0) 4294967296)) linear_search_~a.offset_13)) linear_search_~q_13)) [2022-04-28 02:41:51,865 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) linear_search_~j~0_13) (* (- 1) .v_it_1.0) (* 4294967296 (div (+ linear_search_~j~0_13 .v_it_1.0) 4294967296)) 2147483648) 0)) [2022-04-28 02:41:51,870 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_13 (* (- 4294967296) (div linear_search_~n_13 4294967296)) (* (- 1) linear_search_~j~0_14) (* (- 1) .v_it_2.1) (* 4294967296 (div (+ linear_search_~j~0_14 .v_it_2.1) 4294967296))) 0)) [2022-04-28 02:41:51,870 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_14 .v_it_2.1 (* (- 4294967296) (div (+ linear_search_~j~0_14 .v_it_2.1) 4294967296)) (- 2147483647)) 0)) [2022-04-28 02:41:51,871 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 linear_search_~j~0_14) (* 4 .v_it_2.1) (* (- 17179869184) (div (+ linear_search_~j~0_14 .v_it_2.1) 4294967296)) linear_search_~a.offset_13 (- 17179869184))))) [2022-04-28 02:41:51,878 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_13 (* (- 4294967296) (div linear_search_~n_13 4294967296)) (* (- 1) linear_search_~j~0_16) (* (- 1) .v_it_3.2) (* 4294967296 (div (+ linear_search_~j~0_16 .v_it_3.2) 4294967296))) 0)) [2022-04-28 02:41:51,879 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 linear_search_~j~0_16) (* 4 .v_it_3.2) (* (- 17179869184) (div (+ linear_search_~j~0_16 .v_it_3.2) 4294967296)) linear_search_~a.offset_13 (- 17179869184))))) [2022-04-28 02:41:51,879 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 linear_search_~j~0_16) (* 4 .v_it_3.2) (* (- 17179869184) (div (+ linear_search_~j~0_16 .v_it_3.2) 4294967296)) linear_search_~a.offset_13)) linear_search_~q_13)) [2022-04-28 02:41:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:52,032 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_13 (* (- 4294967296) (div linear_search_~n_13 4294967296)) (* (- 1) linear_search_~j~0_16) (* (- 1) .v_it_3.8) (* 4294967296 (div (+ linear_search_~j~0_16 .v_it_3.8) 4294967296))) 0)) [2022-04-28 02:41:52,032 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 linear_search_~j~0_16) (* 4 .v_it_3.8) (* (- 17179869184) (div (+ linear_search_~j~0_16 .v_it_3.8) 4294967296)) linear_search_~a.offset_13 (- 17179869184))))) [2022-04-28 02:41:52,033 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 linear_search_~j~0_16) (* 4 .v_it_3.8) (* (- 17179869184) (div (+ linear_search_~j~0_16 .v_it_3.8) 4294967296)) linear_search_~a.offset_13)) linear_search_~q_13)) [2022-04-28 02:41:52,034 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_13 (* (- 4294967296) (div linear_search_~n_13 4294967296)) (* (- 1) linear_search_~j~0_14) (* (- 1) .v_it_2.9) (* 4294967296 (div (+ linear_search_~j~0_14 .v_it_2.9) 4294967296))) 0)) [2022-04-28 02:41:52,034 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_14 .v_it_2.9 (* (- 4294967296) (div (+ linear_search_~j~0_14 .v_it_2.9) 4294967296)) (- 2147483647)) 0)) [2022-04-28 02:41:52,035 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 linear_search_~j~0_14) (* 4 .v_it_2.9) (* (- 17179869184) (div (+ linear_search_~j~0_14 .v_it_2.9) 4294967296)) linear_search_~a.offset_13 (- 17179869184))))) [2022-04-28 02:41:52,036 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_13 (* (- 4294967296) (div linear_search_~n_13 4294967296)) (* (- 1) linear_search_~j~0_13) (* (- 1) .v_it_1.10) (* 4294967296 (div (+ linear_search_~j~0_13 .v_it_1.10) 4294967296))) 0)) [2022-04-28 02:41:52,037 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 linear_search_~j~0_13) (* 4 .v_it_1.10) (* (- 17179869184) (div (+ linear_search_~j~0_13 .v_it_1.10) 4294967296)) linear_search_~a.offset_13)) linear_search_~q_13)) [2022-04-28 02:41:52,037 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) linear_search_~j~0_13) (* (- 1) .v_it_1.10) (* 4294967296 (div (+ linear_search_~j~0_13 .v_it_1.10) 4294967296)) 2147483648) 0)) [2022-04-28 02:41:52,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:52,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {725#(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; {702#true} is VALID [2022-04-28 02:41:52,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-28 02:41:52,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {702#true} {702#true} #66#return; {702#true} is VALID [2022-04-28 02:41:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 02:41:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:52,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {727#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 02:41:52,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {727#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {727#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 02:41:52,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {727#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {707#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} #60#return; {711#(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-28 02:41:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 02:41:52,392 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_0 (* (- 4294967296) (div linear_search_~n_0 4294967296)) (* (- 1) linear_search_~j~0_0) (* (- 1) .v_it_1.12) (* 4294967296 (div (+ linear_search_~j~0_0 .v_it_1.12) 4294967296))) 0)) [2022-04-28 02:41:52,393 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 linear_search_~j~0_0) (* 4 .v_it_1.12) (* (- 17179869184) (div (+ linear_search_~j~0_0 .v_it_1.12) 4294967296)) linear_search_~a.offset_0)) linear_search_~q_0)) [2022-04-28 02:41:52,393 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) linear_search_~j~0_0) (* (- 1) .v_it_1.12) (* 4294967296 (div (+ linear_search_~j~0_0 .v_it_1.12) 4294967296)) 2147483648) 0)) [2022-04-28 02:41:52,394 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_0 (* (- 4294967296) (div linear_search_~n_0 4294967296)) (* (- 1) linear_search_~j~0_1) (* (- 1) .v_it_2.13) (* 4294967296 (div (+ linear_search_~j~0_1 .v_it_2.13) 4294967296))) 0)) [2022-04-28 02:41:52,395 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_1 .v_it_2.13 (* (- 4294967296) (div (+ linear_search_~j~0_1 .v_it_2.13) 4294967296)) (- 2147483647)) 0)) [2022-04-28 02:41:52,395 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_0 (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 linear_search_~j~0_1) (* 4 .v_it_2.13) (* (- 17179869184) (div (+ linear_search_~j~0_1 .v_it_2.13) 4294967296)) linear_search_~a.offset_0 (- 17179869184))))) [2022-04-28 02:41:52,398 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_0 (* (- 4294967296) (div linear_search_~n_0 4294967296)) (* (- 1) linear_search_~j~0_3) (* (- 1) .v_it_3.14) (* 4294967296 (div (+ linear_search_~j~0_3 .v_it_3.14) 4294967296))) 0)) [2022-04-28 02:41:52,398 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_0 (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 linear_search_~j~0_3) (* 4 .v_it_3.14) (* (- 17179869184) (div (+ linear_search_~j~0_3 .v_it_3.14) 4294967296)) linear_search_~a.offset_0 (- 17179869184))))) [2022-04-28 02:41:52,399 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 linear_search_~j~0_3) (* 4 .v_it_3.14) (* (- 17179869184) (div (+ linear_search_~j~0_3 .v_it_3.14) 4294967296)) linear_search_~a.offset_0)) linear_search_~q_0)) [2022-04-28 02:41:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:52,431 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_0 (* (- 4294967296) (div linear_search_~n_0 4294967296)) (* (- 1) linear_search_~j~0_0) (* (- 1) .v_it_1.17) (* 4294967296 (div (+ linear_search_~j~0_0 .v_it_1.17) 4294967296))) 0)) [2022-04-28 02:41:52,432 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 linear_search_~j~0_0) (* 4 .v_it_1.17) (* (- 17179869184) (div (+ linear_search_~j~0_0 .v_it_1.17) 4294967296)) linear_search_~a.offset_0)) linear_search_~q_0)) [2022-04-28 02:41:52,432 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) linear_search_~j~0_0) (* (- 1) .v_it_1.17) (* 4294967296 (div (+ linear_search_~j~0_0 .v_it_1.17) 4294967296)) 2147483648) 0)) [2022-04-28 02:41:52,435 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_0 (* (- 4294967296) (div linear_search_~n_0 4294967296)) (* (- 1) linear_search_~j~0_1) (* (- 1) .v_it_2.18) (* 4294967296 (div (+ linear_search_~j~0_1 .v_it_2.18) 4294967296))) 0)) [2022-04-28 02:41:52,436 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_1 .v_it_2.18 (* (- 4294967296) (div (+ linear_search_~j~0_1 .v_it_2.18) 4294967296)) (- 2147483647)) 0)) [2022-04-28 02:41:52,436 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_0 (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 linear_search_~j~0_1) (* 4 .v_it_2.18) (* (- 17179869184) (div (+ linear_search_~j~0_1 .v_it_2.18) 4294967296)) linear_search_~a.offset_0 (- 17179869184))))) [2022-04-28 02:41:52,439 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~n_0 (* (- 4294967296) (div linear_search_~n_0 4294967296)) (* (- 1) linear_search_~j~0_3) (* (- 1) .v_it_3.19) (* 4294967296 (div (+ linear_search_~j~0_3 .v_it_3.19) 4294967296))) 0)) [2022-04-28 02:41:52,439 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_0 (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 linear_search_~j~0_3) (* 4 .v_it_3.19) (* (- 17179869184) (div (+ linear_search_~j~0_3 .v_it_3.19) 4294967296)) linear_search_~a.offset_0 (- 17179869184))))) [2022-04-28 02:41:52,440 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 linear_search_~j~0_3) (* 4 .v_it_3.19) (* (- 17179869184) (div (+ linear_search_~j~0_3 .v_it_3.19) 4294967296)) linear_search_~a.offset_0)) linear_search_~q_0)) [2022-04-28 02:41:52,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {702#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:52,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [70] L17-5-->L17-1_primed: Formula: (let ((.cse7 (mod v_linear_search_~j~0_9 4294967296))) (let ((.cse3 (= |v_linear_search_#t~post6_4| |v_linear_search_#t~post6_3|)) (.cse4 (= v_linear_search_~j~0_9 v_linear_search_~j~0_8)) (.cse5 (= |v_linear_search_#t~mem4_6| |v_linear_search_#t~mem4_4|)) (.cse0 (< .cse7 (mod v_linear_search_~n_3 4294967296))) (.cse2 (<= .cse7 2147483647)) (.cse1 (= (select (select |v_#memory_int_11| v_linear_search_~a.base_3) (+ (* .cse7 4) v_linear_search_~a.offset_3)) v_linear_search_~q_3))) (or (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|))) (or (not .cse0) .cse1 (not .cse2)) .cse3 .cse4 .cse5) (and (= 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) .cse3 (= v_linear_search_~a.base_3 v_linear_search_~a.base_3) (= |v_linear_search_#t~short5_24| |v_linear_search_#t~short5_9|) .cse4 .cse5 (= |v_#memory_int_11| |v_#memory_int_11|)) (and (< v_linear_search_~j~0_9 v_linear_search_~j~0_8) .cse0 .cse2 (forall ((v_it_1 Int)) (or (not (<= (+ v_linear_search_~j~0_9 v_it_1 1) v_linear_search_~j~0_8)) (let ((.cse6 (mod (+ v_linear_search_~j~0_9 v_it_1) 4294967296))) (and (<= .cse6 2147483647) (not (= (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)) (< .cse6 (mod v_linear_search_~n_3 4294967296)))) (not (<= 1 v_it_1)))) (not .cse1))))) 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_9, 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_8, 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] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:52,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [71] L17-1_primed-->L17-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:52,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [72] L17-5-->L17-1_primed: Formula: (let ((.cse6 (mod v_linear_search_~j~0_9 4294967296))) (let ((.cse0 (= (select (select |v_#memory_int_11| v_linear_search_~a.base_3) (+ (* .cse6 4) (- 17179869184) v_linear_search_~a.offset_3)) v_linear_search_~q_3)) (.cse1 (< .cse6 (mod v_linear_search_~n_3 4294967296))) (.cse3 (< 2147483647 .cse6)) (.cse4 (= |v_linear_search_#t~post6_7| |v_linear_search_#t~post6_3|)) (.cse5 (= v_linear_search_~j~0_9 v_linear_search_~j~0_8))) (or (and (not .cse0) (< v_linear_search_~j~0_9 v_linear_search_~j~0_8) .cse1 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_linear_search_~j~0_9 v_it_2 1) v_linear_search_~j~0_8)) (let ((.cse2 (mod (+ v_linear_search_~j~0_9 v_it_2) 4294967296))) (and (not (= v_linear_search_~q_3 (select (select |v_#memory_int_11| v_linear_search_~a.base_3) (+ (* .cse2 4) (- 17179869184) v_linear_search_~a.offset_3)))) (< 2147483647 .cse2) (< .cse2 (mod v_linear_search_~n_3 4294967296)))))) .cse3) (and (= |v_linear_search_#t~mem4_4| |v_linear_search_#t~mem4_9|) .cse4 .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|))) (or .cse0 (not .cse1) (not .cse3))) (and (= 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) .cse4 (= |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) .cse5 (= |v_#memory_int_11| |v_#memory_int_11|))))) 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_9, 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_8, 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] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:52,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [73] L17-1_primed-->L17-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:52,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [74] L17-5-->L17-1_primed: Formula: (let ((.cse9 (mod v_linear_search_~j~0_9 4294967296))) (let ((.cse7 (select |v_#memory_int_11| v_linear_search_~a.base_3)) (.cse8 (* .cse9 4))) (let ((.cse0 (= v_linear_search_~j~0_9 v_linear_search_~j~0_8)) (.cse1 (= (select .cse7 (+ .cse8 (- 17179869184) v_linear_search_~a.offset_3)) v_linear_search_~q_3)) (.cse2 (< .cse9 (mod v_linear_search_~n_3 4294967296))) (.cse3 (= (select .cse7 (+ .cse8 v_linear_search_~a.offset_3)) v_linear_search_~q_3))) (or (and (= |v_linear_search_#t~post6_10| |v_linear_search_#t~post6_3|) (= v_linear_search_~q_3 v_linear_search_~q_3) (= |v_linear_search_#t~mem4_12| |v_linear_search_#t~mem4_4|) (= v_linear_search_~n_3 v_linear_search_~n_3) (= |v_linear_search_#t~short5_38| |v_linear_search_#t~short5_9|) (= v_linear_search_~a.offset_3 v_linear_search_~a.offset_3) (= v_linear_search_~a.base_3 v_linear_search_~a.base_3) .cse0 (= |v_#memory_int_11| |v_#memory_int_11|)) (and (= |v_linear_search_#t~mem4_4| |v_linear_search_#t~mem4_12|) (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|)) (or .cse1 (not .cse2) .cse3) (= |v_linear_search_#t~post6_3| |v_linear_search_#t~post6_10|) .cse0) (and (not .cse1) (< v_linear_search_~j~0_9 v_linear_search_~j~0_8) (forall ((v_it_3 Int)) (or (let ((.cse6 (mod (+ v_linear_search_~j~0_9 v_it_3) 4294967296))) (let ((.cse4 (select |v_#memory_int_11| v_linear_search_~a.base_3)) (.cse5 (* .cse6 4))) (and (not (= (select .cse4 (+ .cse5 v_linear_search_~a.offset_3)) v_linear_search_~q_3)) (not (= v_linear_search_~q_3 (select .cse4 (+ (- 17179869184) .cse5 v_linear_search_~a.offset_3)))) (< .cse6 (mod v_linear_search_~n_3 4294967296))))) (not (<= 1 v_it_3)) (not (<= (+ v_linear_search_~j~0_9 v_it_3 1) v_linear_search_~j~0_8)))) .cse2 (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_38|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_10|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_9, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_12|} 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_8, 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] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:52,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [69] L17-1_primed-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} 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_4} AuxVars[] AssignedVars[linear_search_#t~short5] {729#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))) (not |linear_search_#t~short5|))} is VALID [2022-04-28 02:41:52,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {729#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))) (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; {730#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))))} is VALID [2022-04-28 02:41:52,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {730#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))))} is VALID [2022-04-28 02:41:52,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {730#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {731#(and (or (not (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296)))) (not (= |linear_search_#in~n| (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296)))))) (or (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296))) (not (= (+ ~SIZE~0 (- 4294967296) (* (div ~SIZE~0 4294967296) (- 4294967296))) |linear_search_#in~n|))))} is VALID [2022-04-28 02:41:52,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {731#(and (or (not (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296)))) (not (= |linear_search_#in~n| (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296)))))) (or (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296))) (not (= (+ ~SIZE~0 (- 4294967296) (* (div ~SIZE~0 4294967296) (- 4294967296))) |linear_search_#in~n|))))} assume true; {731#(and (or (not (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296)))) (not (= |linear_search_#in~n| (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296)))))) (or (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296))) (not (= (+ ~SIZE~0 (- 4294967296) (* (div ~SIZE~0 4294967296) (- 4294967296))) |linear_search_#in~n|))))} is VALID [2022-04-28 02:41:52,727 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {731#(and (or (not (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296)))) (not (= |linear_search_#in~n| (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296)))))) (or (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296))) (not (= (+ ~SIZE~0 (- 4294967296) (* (div ~SIZE~0 4294967296) (- 4294967296))) |linear_search_#in~n|))))} {712#(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))} #62#return; {703#false} is VALID [2022-04-28 02:41:52,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {725#(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-28 02:41:52,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#(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; {702#true} is VALID [2022-04-28 02:41:52,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2022-04-28 02:41:52,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #66#return; {702#true} is VALID [2022-04-28 02:41:52,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret10 := main(); {702#true} is VALID [2022-04-28 02:41:52,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {702#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {702#true} is VALID [2022-04-28 02:41:52,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {702#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {707#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} is VALID [2022-04-28 02:41:52,732 INFO L272 TraceCheckUtils]: 7: Hoare triple {707#(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); {726#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 02:41:52,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {726#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {727#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 02:41:52,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {727#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {727#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-28 02:41:52,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {727#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {707#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (= |main_#t~malloc8.offset| 0))} #60#return; {711#(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-28 02:41:54,870 WARN L290 TraceCheckUtils]: 11: Hoare triple {711#(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); {712#(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-28 02:41:54,870 INFO L272 TraceCheckUtils]: 12: Hoare triple {712#(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); {702#true} is VALID [2022-04-28 02:41:54,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {702#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:54,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [70] L17-5-->L17-1_primed: Formula: (let ((.cse7 (mod v_linear_search_~j~0_9 4294967296))) (let ((.cse3 (= |v_linear_search_#t~post6_4| |v_linear_search_#t~post6_3|)) (.cse4 (= v_linear_search_~j~0_9 v_linear_search_~j~0_8)) (.cse5 (= |v_linear_search_#t~mem4_6| |v_linear_search_#t~mem4_4|)) (.cse0 (< .cse7 (mod v_linear_search_~n_3 4294967296))) (.cse2 (<= .cse7 2147483647)) (.cse1 (= (select (select |v_#memory_int_11| v_linear_search_~a.base_3) (+ (* .cse7 4) v_linear_search_~a.offset_3)) v_linear_search_~q_3))) (or (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|))) (or (not .cse0) .cse1 (not .cse2)) .cse3 .cse4 .cse5) (and (= 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) .cse3 (= v_linear_search_~a.base_3 v_linear_search_~a.base_3) (= |v_linear_search_#t~short5_24| |v_linear_search_#t~short5_9|) .cse4 .cse5 (= |v_#memory_int_11| |v_#memory_int_11|)) (and (< v_linear_search_~j~0_9 v_linear_search_~j~0_8) .cse0 .cse2 (forall ((v_it_1 Int)) (or (not (<= (+ v_linear_search_~j~0_9 v_it_1 1) v_linear_search_~j~0_8)) (let ((.cse6 (mod (+ v_linear_search_~j~0_9 v_it_1) 4294967296))) (and (<= .cse6 2147483647) (not (= (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)) (< .cse6 (mod v_linear_search_~n_3 4294967296)))) (not (<= 1 v_it_1)))) (not .cse1))))) 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_9, 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_8, 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] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:54,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [71] L17-1_primed-->L17-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:54,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [72] L17-5-->L17-1_primed: Formula: (let ((.cse6 (mod v_linear_search_~j~0_9 4294967296))) (let ((.cse0 (= (select (select |v_#memory_int_11| v_linear_search_~a.base_3) (+ (* .cse6 4) (- 17179869184) v_linear_search_~a.offset_3)) v_linear_search_~q_3)) (.cse1 (< .cse6 (mod v_linear_search_~n_3 4294967296))) (.cse3 (< 2147483647 .cse6)) (.cse4 (= |v_linear_search_#t~post6_7| |v_linear_search_#t~post6_3|)) (.cse5 (= v_linear_search_~j~0_9 v_linear_search_~j~0_8))) (or (and (not .cse0) (< v_linear_search_~j~0_9 v_linear_search_~j~0_8) .cse1 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_linear_search_~j~0_9 v_it_2 1) v_linear_search_~j~0_8)) (let ((.cse2 (mod (+ v_linear_search_~j~0_9 v_it_2) 4294967296))) (and (not (= v_linear_search_~q_3 (select (select |v_#memory_int_11| v_linear_search_~a.base_3) (+ (* .cse2 4) (- 17179869184) v_linear_search_~a.offset_3)))) (< 2147483647 .cse2) (< .cse2 (mod v_linear_search_~n_3 4294967296)))))) .cse3) (and (= |v_linear_search_#t~mem4_4| |v_linear_search_#t~mem4_9|) .cse4 .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|))) (or .cse0 (not .cse1) (not .cse3))) (and (= 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) .cse4 (= |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) .cse5 (= |v_#memory_int_11| |v_#memory_int_11|))))) 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_9, 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_8, 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] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:54,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [73] L17-1_primed-->L17-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:54,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [74] L17-5-->L17-1_primed: Formula: (let ((.cse9 (mod v_linear_search_~j~0_9 4294967296))) (let ((.cse7 (select |v_#memory_int_11| v_linear_search_~a.base_3)) (.cse8 (* .cse9 4))) (let ((.cse0 (= v_linear_search_~j~0_9 v_linear_search_~j~0_8)) (.cse1 (= (select .cse7 (+ .cse8 (- 17179869184) v_linear_search_~a.offset_3)) v_linear_search_~q_3)) (.cse2 (< .cse9 (mod v_linear_search_~n_3 4294967296))) (.cse3 (= (select .cse7 (+ .cse8 v_linear_search_~a.offset_3)) v_linear_search_~q_3))) (or (and (= |v_linear_search_#t~post6_10| |v_linear_search_#t~post6_3|) (= v_linear_search_~q_3 v_linear_search_~q_3) (= |v_linear_search_#t~mem4_12| |v_linear_search_#t~mem4_4|) (= v_linear_search_~n_3 v_linear_search_~n_3) (= |v_linear_search_#t~short5_38| |v_linear_search_#t~short5_9|) (= v_linear_search_~a.offset_3 v_linear_search_~a.offset_3) (= v_linear_search_~a.base_3 v_linear_search_~a.base_3) .cse0 (= |v_#memory_int_11| |v_#memory_int_11|)) (and (= |v_linear_search_#t~mem4_4| |v_linear_search_#t~mem4_12|) (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|)) (or .cse1 (not .cse2) .cse3) (= |v_linear_search_#t~post6_3| |v_linear_search_#t~post6_10|) .cse0) (and (not .cse1) (< v_linear_search_~j~0_9 v_linear_search_~j~0_8) (forall ((v_it_3 Int)) (or (let ((.cse6 (mod (+ v_linear_search_~j~0_9 v_it_3) 4294967296))) (let ((.cse4 (select |v_#memory_int_11| v_linear_search_~a.base_3)) (.cse5 (* .cse6 4))) (and (not (= (select .cse4 (+ .cse5 v_linear_search_~a.offset_3)) v_linear_search_~q_3)) (not (= v_linear_search_~q_3 (select .cse4 (+ (- 17179869184) .cse5 v_linear_search_~a.offset_3)))) (< .cse6 (mod v_linear_search_~n_3 4294967296))))) (not (<= 1 v_it_3)) (not (<= (+ v_linear_search_~j~0_9 v_it_3 1) v_linear_search_~j~0_8)))) .cse2 (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_38|, linear_search_~q=v_linear_search_~q_3, linear_search_#t~post6=|v_linear_search_#t~post6_10|, #memory_int=|v_#memory_int_11|, linear_search_~j~0=v_linear_search_~j~0_9, linear_search_~a.offset=v_linear_search_~a.offset_3, linear_search_#t~mem4=|v_linear_search_#t~mem4_12|} 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_8, 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] {728#(= |linear_search_#in~n| linear_search_~n)} is VALID [2022-04-28 02:41:54,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {728#(= |linear_search_#in~n| linear_search_~n)} [69] L17-1_primed-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} 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_4} AuxVars[] AssignedVars[linear_search_#t~short5] {729#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))) (not |linear_search_#t~short5|))} is VALID [2022-04-28 02:41:54,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {729#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))) (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; {730#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))))} is VALID [2022-04-28 02:41:54,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {730#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {730#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))))} is VALID [2022-04-28 02:41:54,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {730#(or (<= (+ 4294967297 |linear_search_#in~n|) 0) (and (<= linear_search_~j~0 (+ (* 4294967296 (div linear_search_~j~0 4294967296)) 4294967295 |linear_search_#in~n|)) (or (<= (+ linear_search_~j~0 1) (+ (* 4294967296 (div linear_search_~j~0 4294967296)) |linear_search_#in~n|)) (<= (+ |linear_search_#in~n| 1) 0))))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {731#(and (or (not (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296)))) (not (= |linear_search_#in~n| (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296)))))) (or (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296))) (not (= (+ ~SIZE~0 (- 4294967296) (* (div ~SIZE~0 4294967296) (- 4294967296))) |linear_search_#in~n|))))} is VALID [2022-04-28 02:41:54,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {731#(and (or (not (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296)))) (not (= |linear_search_#in~n| (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296)))))) (or (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296))) (not (= (+ ~SIZE~0 (- 4294967296) (* (div ~SIZE~0 4294967296) (- 4294967296))) |linear_search_#in~n|))))} assume true; {731#(and (or (not (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296)))) (not (= |linear_search_#in~n| (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296)))))) (or (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296))) (not (= (+ ~SIZE~0 (- 4294967296) (* (div ~SIZE~0 4294967296) (- 4294967296))) |linear_search_#in~n|))))} is VALID [2022-04-28 02:41:54,907 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {731#(and (or (not (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296)))) (not (= |linear_search_#in~n| (+ ~SIZE~0 (* (div ~SIZE~0 4294967296) (- 4294967296)))))) (or (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296))) (not (= (+ ~SIZE~0 (- 4294967296) (* (div ~SIZE~0 4294967296) (- 4294967296))) |linear_search_#in~n|))))} {712#(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))} #62#return; {703#false} is VALID [2022-04-28 02:41:54,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {703#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {703#false} is VALID [2022-04-28 02:41:54,907 INFO L272 TraceCheckUtils]: 26: Hoare triple {703#false} call __VERIFIER_assert(#t~ret9); {703#false} is VALID [2022-04-28 02:41:54,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {703#false} ~cond := #in~cond; {703#false} is VALID [2022-04-28 02:41:54,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {703#false} assume 0 == ~cond; {703#false} is VALID [2022-04-28 02:41:54,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {703#false} assume !false; {703#false} is VALID [2022-04-28 02:41:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 02:41:54,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:54,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846142803] [2022-04-28 02:41:54,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846142803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:54,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:54,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 02:41:55,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:55,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2071047056] [2022-04-28 02:41:55,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2071047056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:55,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:55,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 02:41:55,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052620773] [2022-04-28 02:41:55,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:55,667 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-28 02:41:55,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:55,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (5), 4 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-28 02:41:55,671 WARN L143 InductivityCheck]: Transition 738#(and (or (not (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296)))) (not (= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) |linear_search_#in~n|)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= __VERIFIER_assert_~cond 0) (or (<= ~SIZE~0 (+ 2147483647 (* (div ~SIZE~0 4294967296) 4294967296))) (not (= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) |linear_search_#in~n| 4294967296))))) ( _ , assume !false; , 703#false ) not inductive [2022-04-28 02:41:55,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 02:41:55,672 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 02:41:55,675 INFO L158 Benchmark]: Toolchain (without parser) took 20187.49ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 130.0MB in the beginning and 134.3MB in the end (delta: -4.4MB). Peak memory consumption was 65.8MB. Max. memory is 8.0GB. [2022-04-28 02:41:55,676 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:41:55,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.80ms. Allocated memory is still 184.5MB. Free memory was 129.9MB in the beginning and 159.1MB in the end (delta: -29.2MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-28 02:41:55,676 INFO L158 Benchmark]: Boogie Preprocessor took 47.16ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 157.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 02:41:55,677 INFO L158 Benchmark]: RCFGBuilder took 385.46ms. Allocated memory is still 184.5MB. Free memory was 157.4MB in the beginning and 144.4MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 02:41:55,677 INFO L158 Benchmark]: TraceAbstraction took 19493.81ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 144.0MB in the beginning and 134.3MB in the end (delta: 9.7MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2022-04-28 02:41:55,679 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.80ms. Allocated memory is still 184.5MB. Free memory was 129.9MB in the beginning and 159.1MB in the end (delta: -29.2MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.16ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 157.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 385.46ms. Allocated memory is still 184.5MB. Free memory was 157.4MB in the beginning and 144.4MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 19493.81ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 144.0MB in the beginning and 134.3MB in the end (delta: 9.7MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 02:41:55,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...