/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:58,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:58,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:58,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:58,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:58,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:58,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:58,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:58,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:58,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:58,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:58,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:58,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:58,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:58,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:58,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:58,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:58,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:58,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:58,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:58,872 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:58,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:58,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:58,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:58,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:58,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:58,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:58,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:58,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:58,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:58,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:58,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:58,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:58,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:58,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:58,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:58,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:58,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:58,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:58,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:58,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:58,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:58,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:16:58,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:58,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:58,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:58,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:58,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:58,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:58,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:58,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:58,915 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:58,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:58,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:58,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:58,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:58,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:58,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:58,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:58,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:58,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:58,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:58,918 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:58,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:58,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:58,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:58,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:58,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:58,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:58,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:58,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:58,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:58,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:58,920 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:58,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:58,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:58,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:16:59,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:59,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:59,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:59,161 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:59,161 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:59,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2022-04-27 10:16:59,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c3763b9/b73460a3391a4bcebca9eaf8aec015f9/FLAG2619ece28 [2022-04-27 10:16:59,564 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:59,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2022-04-27 10:16:59,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c3763b9/b73460a3391a4bcebca9eaf8aec015f9/FLAG2619ece28 [2022-04-27 10:17:00,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21c3763b9/b73460a3391a4bcebca9eaf8aec015f9 [2022-04-27 10:17:00,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:17:00,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:17:00,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:00,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:17:00,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:17:00,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@107ce2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00, skipping insertion in model container [2022-04-27 10:17:00,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:17:00,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:17:00,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-04-27 10:17:00,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:00,231 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:17:00,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-04-27 10:17:00,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:00,276 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:17:00,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00 WrapperNode [2022-04-27 10:17:00,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:00,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:17:00,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:17:00,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:17:00,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:17:00,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:17:00,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:17:00,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:17:00,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00" (1/1) ... [2022-04-27 10:17:00,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:00,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:00,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:17:00,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:17:00,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:17:00,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:17:00,416 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:17:00,417 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:17:00,419 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-27 10:17:00,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:17:00,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 10:17:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:17:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:17:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:17:00,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:17:00,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:17:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:17:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:17:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:17:00,502 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:17:00,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:17:02,813 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:17:02,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:17:02,821 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:17:02,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:02 BoogieIcfgContainer [2022-04-27 10:17:02,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:17:02,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:17:02,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:17:02,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:17:02,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:17:00" (1/3) ... [2022-04-27 10:17:02,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9db7116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:02, skipping insertion in model container [2022-04-27 10:17:02,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:00" (2/3) ... [2022-04-27 10:17:02,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9db7116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:02, skipping insertion in model container [2022-04-27 10:17:02,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:02" (3/3) ... [2022-04-27 10:17:02,834 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.c [2022-04-27 10:17:02,848 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:17:02,848 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:17:02,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:17:02,899 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@561a8141, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e7ee390 [2022-04-27 10:17:02,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:17:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:17:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:17:02,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:02,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:02,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 1 times [2022-04-27 10:17:02,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:02,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296215065] [2022-04-27 10:17:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:02,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {37#true} is VALID [2022-04-27 10:17:03,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 10:17:03,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID [2022-04-27 10:17:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:17:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {37#true} is VALID [2022-04-27 10:17:03,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 10:17:03,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID [2022-04-27 10:17:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:17:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {37#true} is VALID [2022-04-27 10:17:03,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume !true; {38#false} is VALID [2022-04-27 10:17:03,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID [2022-04-27 10:17:03,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 10:17:03,258 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID [2022-04-27 10:17:03,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:03,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {37#true} is VALID [2022-04-27 10:17:03,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 10:17:03,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID [2022-04-27 10:17:03,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID [2022-04-27 10:17:03,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {37#true} is VALID [2022-04-27 10:17:03,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {37#true} is VALID [2022-04-27 10:17:03,263 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {51#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:17:03,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {37#true} is VALID [2022-04-27 10:17:03,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 10:17:03,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID [2022-04-27 10:17:03,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {37#true} is VALID [2022-04-27 10:17:03,264 INFO L272 TraceCheckUtils]: 12: Hoare triple {37#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {37#true} is VALID [2022-04-27 10:17:03,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {37#true} is VALID [2022-04-27 10:17:03,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume !true; {38#false} is VALID [2022-04-27 10:17:03,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID [2022-04-27 10:17:03,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 10:17:03,265 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID [2022-04-27 10:17:03,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {38#false} is VALID [2022-04-27 10:17:03,268 INFO L272 TraceCheckUtils]: 19: Hoare triple {38#false} call __VERIFIER_assert(#t~ret9); {38#false} is VALID [2022-04-27 10:17:03,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-27 10:17:03,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-27 10:17:03,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-27 10:17:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:03,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296215065] [2022-04-27 10:17:03,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296215065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:03,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:03,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:17:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569590000] [2022-04-27 10:17:03,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:03,280 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-27 10:17:03,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:03,285 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-27 10:17:03,314 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-27 10:17:03,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:17:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:17:03,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:17:03,335 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 10:17:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,596 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-27 10:17:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:17:03,597 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-27 10:17:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:03,600 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-27 10:17:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 10:17:03,607 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-27 10:17:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 10:17:03,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-27 10:17:03,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:03,693 INFO L225 Difference]: With dead ends: 52 [2022-04-27 10:17:03,693 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 10:17:03,697 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-27 10:17:03,705 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:03,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:17:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 10:17:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 10:17:03,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:03,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:03,752 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:03,753 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,758 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 10:17:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 10:17:03,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:03,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:03,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 10:17:03,761 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 10:17:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,765 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 10:17:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 10:17:03,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:03,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:03,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:03,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-27 10:17:03,781 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-27 10:17:03,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:03,782 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-27 10:17:03,782 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-27 10:17:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 10:17:03,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:17:03,783 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:03,784 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-27 10:17:03,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:17:03,784 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:03,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 1 times [2022-04-27 10:17:03,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:03,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631017988] [2022-04-27 10:17:03,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:03,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#(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; {214#true} is VALID [2022-04-27 10:17:03,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} assume true; {214#true} is VALID [2022-04-27 10:17:03,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} #72#return; {214#true} is VALID [2022-04-27 10:17:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:17:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {214#true} is VALID [2022-04-27 10:17:04,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} assume true; {214#true} is VALID [2022-04-27 10:17:04,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} #66#return; {214#true} is VALID [2022-04-27 10:17:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:17:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {214#true} is VALID [2022-04-27 10:17:04,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {214#true} is VALID [2022-04-27 10:17:04,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#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; {214#true} is VALID [2022-04-27 10:17:04,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {214#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {214#true} is VALID [2022-04-27 10:17:04,109 INFO L290 TraceCheckUtils]: 4: Hoare triple {214#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-27 10:17:04,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-27 10:17:04,112 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {214#true} #68#return; {229#(= |main_#t~ret9| 1)} is VALID [2022-04-27 10:17:04,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {214#true} call ULTIMATE.init(); {232#(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-27 10:17:04,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(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; {214#true} is VALID [2022-04-27 10:17:04,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#true} assume true; {214#true} is VALID [2022-04-27 10:17:04,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {214#true} {214#true} #72#return; {214#true} is VALID [2022-04-27 10:17:04,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {214#true} call #t~ret10 := main(); {214#true} is VALID [2022-04-27 10:17:04,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {214#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {214#true} is VALID [2022-04-27 10:17:04,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {214#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {214#true} is VALID [2022-04-27 10:17:04,122 INFO L272 TraceCheckUtils]: 7: Hoare triple {214#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:17:04,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {214#true} is VALID [2022-04-27 10:17:04,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {214#true} assume true; {214#true} is VALID [2022-04-27 10:17:04,123 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {214#true} {214#true} #66#return; {214#true} is VALID [2022-04-27 10:17:04,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {214#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); {214#true} is VALID [2022-04-27 10:17:04,123 INFO L272 TraceCheckUtils]: 12: Hoare triple {214#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); {214#true} is VALID [2022-04-27 10:17:04,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {214#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {214#true} is VALID [2022-04-27 10:17:04,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {214#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {214#true} is VALID [2022-04-27 10:17:04,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {214#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; {214#true} is VALID [2022-04-27 10:17:04,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {214#true} is VALID [2022-04-27 10:17:04,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {214#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-27 10:17:04,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-27 10:17:04,126 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {214#true} #68#return; {229#(= |main_#t~ret9| 1)} is VALID [2022-04-27 10:17:04,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {229#(= |main_#t~ret9| 1)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {229#(= |main_#t~ret9| 1)} is VALID [2022-04-27 10:17:04,128 INFO L272 TraceCheckUtils]: 21: Hoare triple {229#(= |main_#t~ret9| 1)} call __VERIFIER_assert(#t~ret9); {230#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 10:17:04,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {230#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {231#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 10:17:04,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {215#false} is VALID [2022-04-27 10:17:04,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {215#false} assume !false; {215#false} is VALID [2022-04-27 10:17:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:04,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631017988] [2022-04-27 10:17:04,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631017988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:04,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:04,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:17:04,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58777369] [2022-04-27 10:17:04,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:04,136 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-27 10:17:04,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:04,137 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-27 10:17:04,161 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-27 10:17:04,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:17:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:04,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:17:04,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:17:04,163 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 10:17:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,681 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-27 10:17:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:17:04,681 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-27 10:17:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:04,682 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-27 10:17:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-27 10:17:04,684 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-27 10:17:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-27 10:17:04,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-27 10:17:04,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:04,727 INFO L225 Difference]: With dead ends: 35 [2022-04-27 10:17:04,728 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 10:17:04,728 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-27 10:17:04,729 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:04,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:17:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 10:17:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 10:17:04,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:04,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:04,734 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:04,734 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:04,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,736 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 10:17:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 10:17:04,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:04,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:04,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 10:17:04,737 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 10:17:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,739 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 10:17:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 10:17:04,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:04,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:04,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:04,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-27 10:17:04,742 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-04-27 10:17:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:04,742 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-27 10:17:04,743 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-27 10:17:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 10:17:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:17:04,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:04,743 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-27 10:17:04,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:17:04,744 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:04,744 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 1 times [2022-04-27 10:17:04,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:04,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470129388] [2022-04-27 10:17:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:04,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(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; {386#true} is VALID [2022-04-27 10:17:04,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-27 10:17:04,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {386#true} {386#true} #72#return; {386#true} is VALID [2022-04-27 10:17:04,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:17:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {386#true} is VALID [2022-04-27 10:17:04,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-27 10:17:04,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {386#true} {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:04,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:17:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {386#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:17:04,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {405#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-27 10:17:04,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#(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; {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:17:04,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:17:04,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:17:04,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:17:05,001 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {387#false} is VALID [2022-04-27 10:17:05,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {402#(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-27 10:17:05,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#(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; {386#true} is VALID [2022-04-27 10:17:05,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-27 10:17:05,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} #72#return; {386#true} is VALID [2022-04-27 10:17:05,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} call #t~ret10 := main(); {386#true} is VALID [2022-04-27 10:17:05,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {386#true} is VALID [2022-04-27 10:17:05,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:05,005 INFO L272 TraceCheckUtils]: 7: Hoare triple {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {403#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:17:05,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {403#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {386#true} is VALID [2022-04-27 10:17:05,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {386#true} assume true; {386#true} is VALID [2022-04-27 10:17:05,007 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {386#true} {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:05,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {391#(<= (+ 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); {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:05,007 INFO L272 TraceCheckUtils]: 12: Hoare triple {391#(<= (+ 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); {386#true} is VALID [2022-04-27 10:17:05,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:17:05,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {405#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-27 10:17:05,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {405#(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; {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:17:05,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:17:05,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:17:05,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:17:05,016 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {387#false} is VALID [2022-04-27 10:17:05,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {387#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {387#false} is VALID [2022-04-27 10:17:05,016 INFO L272 TraceCheckUtils]: 21: Hoare triple {387#false} call __VERIFIER_assert(#t~ret9); {387#false} is VALID [2022-04-27 10:17:05,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {387#false} ~cond := #in~cond; {387#false} is VALID [2022-04-27 10:17:05,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {387#false} assume 0 == ~cond; {387#false} is VALID [2022-04-27 10:17:05,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {387#false} assume !false; {387#false} is VALID [2022-04-27 10:17:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:05,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:05,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470129388] [2022-04-27 10:17:05,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470129388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:05,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:05,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:17:05,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363060097] [2022-04-27 10:17:05,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:05,019 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-27 10:17:05,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:05,019 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-27 10:17:05,048 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-27 10:17:05,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:17:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:05,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:17:05,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:17:05,050 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:17:09,507 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-27 10:17:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:10,038 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-27 10:17:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:17:10,038 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-27 10:17:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:10,039 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-27 10:17:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-27 10:17:10,041 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-27 10:17:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-27 10:17:10,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-04-27 10:17:10,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:10,101 INFO L225 Difference]: With dead ends: 40 [2022-04-27 10:17:10,101 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 10:17:10,101 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-27 10:17:10,102 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:10,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 10:17:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 10:17:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-27 10:17:10,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:10,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:10,125 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:10,126 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:10,133 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 10:17:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-27 10:17:10,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:10,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:10,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-27 10:17:10,134 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-27 10:17:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:10,139 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 10:17:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-27 10:17:10,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:10,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:10,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:10,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-27 10:17:10,141 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-04-27 10:17:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:10,142 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-27 10:17:10,142 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-27 10:17:10,142 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-27 10:17:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:17:10,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:10,143 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, 1] [2022-04-27 10:17:10,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:17:10,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash 33102019, now seen corresponding path program 1 times [2022-04-27 10:17:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081245846] [2022-04-27 10:17:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:10,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#(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; {584#true} is VALID [2022-04-27 10:17:10,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-27 10:17:10,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #72#return; {584#true} is VALID [2022-04-27 10:17:10,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:17:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:10,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {604#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {584#true} is VALID [2022-04-27 10:17:10,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-27 10:17:10,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #66#return; {584#true} is VALID [2022-04-27 10:17:10,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:17:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:10,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:10,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:10,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} 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; {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:10,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {606#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:17:10,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {606#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {585#false} is VALID [2022-04-27 10:17:10,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#false} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {585#false} is VALID [2022-04-27 10:17:10,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {585#false} 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; {585#false} is VALID [2022-04-27 10:17:10,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {585#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {585#false} is VALID [2022-04-27 10:17:10,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {585#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {585#false} is VALID [2022-04-27 10:17:10,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {585#false} assume true; {585#false} is VALID [2022-04-27 10:17:10,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {585#false} {584#true} #68#return; {585#false} is VALID [2022-04-27 10:17:10,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {584#true} call ULTIMATE.init(); {603#(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-27 10:17:10,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#(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; {584#true} is VALID [2022-04-27 10:17:10,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-27 10:17:10,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {584#true} {584#true} #72#return; {584#true} is VALID [2022-04-27 10:17:10,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {584#true} call #t~ret10 := main(); {584#true} is VALID [2022-04-27 10:17:10,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {584#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {584#true} is VALID [2022-04-27 10:17:10,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {584#true} is VALID [2022-04-27 10:17:10,318 INFO L272 TraceCheckUtils]: 7: Hoare triple {584#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {604#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:17:10,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {584#true} is VALID [2022-04-27 10:17:10,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} assume true; {584#true} is VALID [2022-04-27 10:17:10,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {584#true} {584#true} #66#return; {584#true} is VALID [2022-04-27 10:17:10,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {584#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); {584#true} is VALID [2022-04-27 10:17:10,319 INFO L272 TraceCheckUtils]: 12: Hoare triple {584#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); {584#true} is VALID [2022-04-27 10:17:10,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {584#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:10,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:10,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} 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; {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:10,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {606#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:17:10,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {606#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {585#false} is VALID [2022-04-27 10:17:10,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {585#false} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {585#false} is VALID [2022-04-27 10:17:10,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {585#false} 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; {585#false} is VALID [2022-04-27 10:17:10,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {585#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {585#false} is VALID [2022-04-27 10:17:10,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {585#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {585#false} is VALID [2022-04-27 10:17:10,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {585#false} assume true; {585#false} is VALID [2022-04-27 10:17:10,325 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {585#false} {584#true} #68#return; {585#false} is VALID [2022-04-27 10:17:10,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {585#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {585#false} is VALID [2022-04-27 10:17:10,325 INFO L272 TraceCheckUtils]: 25: Hoare triple {585#false} call __VERIFIER_assert(#t~ret9); {585#false} is VALID [2022-04-27 10:17:10,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {585#false} ~cond := #in~cond; {585#false} is VALID [2022-04-27 10:17:10,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#false} assume 0 == ~cond; {585#false} is VALID [2022-04-27 10:17:10,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-04-27 10:17:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:10,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:10,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081245846] [2022-04-27 10:17:10,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081245846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:10,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:10,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:17:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581827333] [2022-04-27 10:17:10,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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 29 [2022-04-27 10:17:10,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:10,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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-27 10:17:10,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:10,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:17:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:17:10,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:17:10,357 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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-27 10:17:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:10,726 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-27 10:17:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:17:10,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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 29 [2022-04-27 10:17:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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-27 10:17:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-27 10:17:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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-27 10:17:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-27 10:17:10,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-27 10:17:10,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:10,798 INFO L225 Difference]: With dead ends: 50 [2022-04-27 10:17:10,799 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 10:17:10,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:17:10,800 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:10,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 31 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:17:10,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 10:17:10,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-04-27 10:17:10,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:10,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-27 10:17:10,819 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-27 10:17:10,819 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-27 10:17:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:10,821 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-27 10:17:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-27 10:17:10,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:10,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:10,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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 37 states. [2022-04-27 10:17:10,822 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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 37 states. [2022-04-27 10:17:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:10,824 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-27 10:17:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-27 10:17:10,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:10,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:10,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:10,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-27 10:17:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 10:17:10,826 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2022-04-27 10:17:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:10,827 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 10:17:10,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 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-27 10:17:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 10:17:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:17:10,828 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:10,828 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, 1] [2022-04-27 10:17:10,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:17:10,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash 291267457, now seen corresponding path program 1 times [2022-04-27 10:17:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:10,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214338122] [2022-04-27 10:17:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:10,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:10,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:10,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {819#(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; {799#true} is VALID [2022-04-27 10:17:10,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume true; {799#true} is VALID [2022-04-27 10:17:10,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {799#true} {799#true} #72#return; {799#true} is VALID [2022-04-27 10:17:10,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:17:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:10,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {820#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {799#true} is VALID [2022-04-27 10:17:10,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume true; {799#true} is VALID [2022-04-27 10:17:10,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {799#true} {804#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {804#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:10,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:17:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:11,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {821#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:11,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {822#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:11,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} 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; {822#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:11,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {822#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {823#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-27 10:17:11,156 INFO L290 TraceCheckUtils]: 4: Hoare triple {823#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} assume !(20 == ~j~0 % 4294967296); {823#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-27 10:17:11,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {824#(or (and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-27 10:17:11,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {824#(or (and (<= linear_search_~j~0 1) (< 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; {825#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-27 10:17:11,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {825#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {825#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-27 10:17:11,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {825#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {826#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:11,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {826#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {826#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:11,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {826#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {804#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {800#false} is VALID [2022-04-27 10:17:11,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {819#(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-27 10:17:11,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {819#(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; {799#true} is VALID [2022-04-27 10:17:11,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2022-04-27 10:17:11,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #72#return; {799#true} is VALID [2022-04-27 10:17:11,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret10 := main(); {799#true} is VALID [2022-04-27 10:17:11,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {799#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {799#true} is VALID [2022-04-27 10:17:11,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {799#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {804#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:11,166 INFO L272 TraceCheckUtils]: 7: Hoare triple {804#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {820#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:17:11,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {820#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {799#true} is VALID [2022-04-27 10:17:11,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {799#true} assume true; {799#true} is VALID [2022-04-27 10:17:11,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {799#true} {804#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {804#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:11,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {804#(<= (+ 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); {804#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:11,168 INFO L272 TraceCheckUtils]: 12: Hoare triple {804#(<= (+ 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); {799#true} is VALID [2022-04-27 10:17:11,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {799#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {821#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:11,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {821#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {822#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:11,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} 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; {822#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:11,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {823#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-27 10:17:11,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} assume !(20 == ~j~0 % 4294967296); {823#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-27 10:17:11,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {824#(or (and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-27 10:17:11,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {824#(or (and (<= linear_search_~j~0 1) (< 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; {825#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-27 10:17:11,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {825#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {825#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-27 10:17:11,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {825#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {826#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:11,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {826#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {826#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:11,178 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {826#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {804#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {800#false} is VALID [2022-04-27 10:17:11,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {800#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {800#false} is VALID [2022-04-27 10:17:11,178 INFO L272 TraceCheckUtils]: 25: Hoare triple {800#false} call __VERIFIER_assert(#t~ret9); {800#false} is VALID [2022-04-27 10:17:11,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#false} ~cond := #in~cond; {800#false} is VALID [2022-04-27 10:17:11,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#false} assume 0 == ~cond; {800#false} is VALID [2022-04-27 10:17:11,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {800#false} assume !false; {800#false} is VALID [2022-04-27 10:17:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:11,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:11,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214338122] [2022-04-27 10:17:11,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214338122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:11,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16899631] [2022-04-27 10:17:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:11,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:11,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:11,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:11,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:17:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:11,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 10:17:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-27 10:17:13,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:13,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-04-27 10:17:14,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2022-04-27 10:17:26,820 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (exists ((v_ArrVal_38 Int)) (= (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) c_main_~a~0.offset) v_ArrVal_38) (select |c_#memory_int| c_main_~a~0.base))))) is different from false [2022-04-27 10:17:33,252 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-04-27 10:17:39,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-04-27 10:18:03,953 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) (not |c_linear_search_#t~short5|)))) is different from false [2022-04-27 10:18:10,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (< .cse7 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-04-27 10:18:16,949 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (< .cse1 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (let ((.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse1 4)) (.cse2 (<= .cse1 2147483647))) (or (and .cse2 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (and (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))) (not .cse2)))))) is different from false [2022-04-27 10:18:24,995 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse1 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse2 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3))) (and (<= 0 .cse1) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- 17179869184) (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (< .cse1 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse2) (< .cse2 4294967296))))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse4 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse5 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6))) (and (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (<= 0 .cse4) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< .cse4 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse5) (< .cse5 4294967296)))))))) is different from false [2022-04-27 10:18:46,075 WARN L232 SmtUtils]: Spent 12.78s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-27 10:18:46,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:18:46,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 153 [2022-04-27 10:19:23,165 WARN L232 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-27 10:20:02,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2022-04-27 10:20:02,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {799#true} is VALID [2022-04-27 10:20:02,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2022-04-27 10:20:02,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #72#return; {799#true} is VALID [2022-04-27 10:20:02,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret10 := main(); {799#true} is VALID [2022-04-27 10:20:02,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {799#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {799#true} is VALID [2022-04-27 10:20:02,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {799#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {848#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-27 10:20:02,167 INFO L272 TraceCheckUtils]: 7: Hoare triple {848#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 1 (mod ~SIZE~0 4294967296)))} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {848#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-27 10:20:02,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {848#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 1 (mod ~SIZE~0 4294967296)))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {855#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-27 10:20:02,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {855#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} assume true; {855#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-27 10:20:02,170 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {855#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} {848#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 1 (mod ~SIZE~0 4294967296)))} #66#return; {862#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc8.base|)) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-27 10:20:04,311 WARN L290 TraceCheckUtils]: 11: Hoare triple {862#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc8.base|)) (< 1 (mod ~SIZE~0 4294967296)))} ~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); {866#(and (< (mod ~SIZE~0 4294967296) 4294967295) (exists ((v_ArrVal_38 Int)) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38))) (< 1 (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-27 10:20:04,317 INFO L272 TraceCheckUtils]: 12: Hoare triple {866#(and (< (mod ~SIZE~0 4294967296) 4294967295) (exists ((v_ArrVal_38 Int)) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38))) (< 1 (mod ~SIZE~0 4294967296)))} 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); {870#(and (< (mod ~SIZE~0 4294967296) 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-27 10:20:06,459 WARN L290 TraceCheckUtils]: 13: Hoare triple {870#(and (< (mod ~SIZE~0 4294967296) 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-27 10:20:08,603 WARN L290 TraceCheckUtils]: 14: Hoare triple {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-27 10:20:10,747 WARN L290 TraceCheckUtils]: 15: Hoare triple {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} 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; {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-27 10:20:12,887 WARN L290 TraceCheckUtils]: 16: Hoare triple {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-27 10:20:15,028 WARN L290 TraceCheckUtils]: 17: Hoare triple {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} assume !(20 == ~j~0 % 4294967296); {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-27 10:20:17,169 WARN L290 TraceCheckUtils]: 18: Hoare triple {874#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {890#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (or (< (mod linear_search_~j~0 4294967296) 4294967295) (not |linear_search_#t~short5|)) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-27 10:20:19,312 WARN L290 TraceCheckUtils]: 19: Hoare triple {890#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (or (< (mod linear_search_~j~0 4294967296) 4294967295) (not |linear_search_#t~short5|)) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} 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; {894#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (and (not (<= (mod linear_search_~j~0 4294967296) 2147483647)) (or (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|))) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not |linear_search_#t~short5|)))) (and (or (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|))) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not |linear_search_#t~short5|))) (<= (mod linear_search_~j~0 4294967296) 2147483647))) (< (mod linear_search_~j~0 4294967296) 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-27 10:20:21,456 WARN L290 TraceCheckUtils]: 20: Hoare triple {894#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (and (not (<= (mod linear_search_~j~0 4294967296) 2147483647)) (or (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|))) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not |linear_search_#t~short5|)))) (and (or (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|))) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not |linear_search_#t~short5|))) (<= (mod linear_search_~j~0 4294967296) 2147483647))) (< (mod linear_search_~j~0 4294967296) 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {898#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< (mod linear_search_~j~0 4294967296) 4294967295) (or (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (<= (mod linear_search_~j~0 4294967296) 2147483647)) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not (<= (mod linear_search_~j~0 4294967296) 2147483647)))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-27 10:20:23,601 WARN L290 TraceCheckUtils]: 21: Hoare triple {898#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< (mod linear_search_~j~0 4294967296) 4294967295) (or (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (<= (mod linear_search_~j~0 4294967296) 2147483647)) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not (<= (mod linear_search_~j~0 4294967296) 2147483647)))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {902#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296)))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-27 10:20:25,744 WARN L290 TraceCheckUtils]: 22: Hoare triple {902#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296)))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} assume true; {902#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296)))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-27 10:20:27,891 WARN L284 TraceCheckUtils]: 23: Hoare quadruple {902#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296)))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} {866#(and (< (mod ~SIZE~0 4294967296) 4294967295) (exists ((v_ArrVal_38 Int)) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38))) (< 1 (mod ~SIZE~0 4294967296)))} #68#return; {800#false} is UNKNOWN [2022-04-27 10:20:27,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {800#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {800#false} is VALID [2022-04-27 10:20:27,891 INFO L272 TraceCheckUtils]: 25: Hoare triple {800#false} call __VERIFIER_assert(#t~ret9); {800#false} is VALID [2022-04-27 10:20:27,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#false} ~cond := #in~cond; {800#false} is VALID [2022-04-27 10:20:27,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#false} assume 0 == ~cond; {800#false} is VALID [2022-04-27 10:20:27,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {800#false} assume !false; {800#false} is VALID [2022-04-27 10:20:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-04-27 10:20:27,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:20:33,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16899631] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:20:33,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:20:33,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-04-27 10:20:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619796362] [2022-04-27 10:20:33,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:20:33,898 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-04-27 10:20:33,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:20:33,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:21:01,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 36 inductive. 0 not inductive. 13 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:01,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 10:21:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:01,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 10:21:01,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=179, Unknown=7, NotChecked=224, Total=462 [2022-04-27 10:21:01,861 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:21:06,404 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-27 10:21:08,711 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (<= (+ 2 (* (div c_~SIZE~0 4294967296) 4294967296)) c_~SIZE~0) (exists ((v_ArrVal_38 Int)) (= (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) c_main_~a~0.offset) v_ArrVal_38) (select |c_#memory_int| c_main_~a~0.base))))) is different from false [2022-04-27 10:21:10,866 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (<= 0 c_linear_search_~j~0) (< .cse0 4294967295) (< 1 .cse0) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-04-27 10:21:13,022 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) (not |c_linear_search_#t~short5|)) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-04-27 10:21:15,193 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (< .cse7 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-04-27 10:21:17,350 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (not (<= (+ (div c_linear_search_~j~0 4294967296) 1) 0)) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967294 (* (div c_linear_search_~n 4294967296) 4294967296)))))) is different from false [2022-04-27 10:21:19,508 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (not |c_linear_search_#t~short5|))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) .cse1) (or (and (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (<= c_linear_search_~j~0 1)) .cse1))) is different from false [2022-04-27 10:21:21,667 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (< .cse7 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-04-27 10:21:23,824 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 .cse0) (<= c_linear_search_~j~0 1) (< .cse1 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (let ((.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse1 4)) (.cse2 (<= .cse1 2147483647))) (or (and .cse2 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (and (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))) (not .cse2)))))) is different from false [2022-04-27 10:21:26,019 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (< .cse7 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-04-27 10:21:28,232 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< .cse0 4294967295) (< 1 .cse0) (= |c_old(#memory_int)| |c_#memory_int|) (= c_~MAX~0 |c_old(~MAX~0)|) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse1 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse2 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3))) (and (<= 0 .cse1) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- 17179869184) (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (< .cse1 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse2) (< .cse2 4294967296))))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse4 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse5 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6))) (and (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (<= 0 .cse4) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< .cse4 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse5) (< .cse5 4294967296)))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0))) is different from false [2022-04-27 10:21:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:28,282 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 10:21:28,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 10:21:28,282 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-04-27 10:21:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:21:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 57 transitions. [2022-04-27 10:21:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:21:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 57 transitions. [2022-04-27 10:21:28,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 57 transitions. [2022-04-27 10:22:09,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 38 inductive. 0 not inductive. 19 times theorem prover too weak to decide inductivity. [2022-04-27 10:22:09,096 INFO L225 Difference]: With dead ends: 52 [2022-04-27 10:22:09,096 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 10:22:09,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=106, Invalid=365, Unknown=17, NotChecked=918, Total=1406 [2022-04-27 10:22:09,097 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:22:09,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 1 Unknown, 117 Unchecked, 2.1s Time] [2022-04-27 10:22:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 10:22:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-27 10:22:09,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:22:09,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-27 10:22:09,126 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-27 10:22:09,126 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-27 10:22:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:09,128 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-27 10:22:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-27 10:22:09,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:09,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:09,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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 40 states. [2022-04-27 10:22:09,129 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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 40 states. [2022-04-27 10:22:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:09,131 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-27 10:22:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-27 10:22:09,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:09,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:09,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:22:09,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:22:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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-27 10:22:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-27 10:22:09,133 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2022-04-27 10:22:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:22:09,134 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-27 10:22:09,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 10:22:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-27 10:22:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 10:22:09,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:22:09,135 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:22:09,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 10:22:09,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:22:09,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:22:09,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:22:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash -101759553, now seen corresponding path program 1 times [2022-04-27 10:22:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:22:09,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487881272] [2022-04-27 10:22:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:22:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:09,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:22:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:09,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#(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; {1175#true} is VALID [2022-04-27 10:22:09,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-27 10:22:09,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1175#true} {1175#true} #72#return; {1175#true} is VALID [2022-04-27 10:22:09,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:22:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:09,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {1196#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1175#true} is VALID [2022-04-27 10:22:09,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-27 10:22:09,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1175#true} {1180#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {1180#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:22:09,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:22:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:09,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {1175#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:22:09,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:22:09,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} 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; {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:22:09,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(20 == ~j~0 % 4294967296); {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5; {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1199#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:22:09,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {1199#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {1199#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:22:09,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1199#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {1180#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {1176#false} is VALID [2022-04-27 10:22:09,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1195#(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-27 10:22:09,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#(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; {1175#true} is VALID [2022-04-27 10:22:09,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-27 10:22:09,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #72#return; {1175#true} is VALID [2022-04-27 10:22:09,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret10 := main(); {1175#true} is VALID [2022-04-27 10:22:09,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {1175#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {1175#true} is VALID [2022-04-27 10:22:09,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {1180#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:22:09,569 INFO L272 TraceCheckUtils]: 7: Hoare triple {1180#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {1196#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:22:09,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1175#true} is VALID [2022-04-27 10:22:09,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-27 10:22:09,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1175#true} {1180#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {1180#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:22:09,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {1180#(<= (+ 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); {1180#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:22:09,571 INFO L272 TraceCheckUtils]: 12: Hoare triple {1180#(<= (+ 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); {1175#true} is VALID [2022-04-27 10:22:09,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {1175#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:22:09,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:22:09,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} 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; {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:22:09,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {1197#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(20 == ~j~0 % 4294967296); {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5; {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:22:09,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {1198#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1199#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:22:09,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {1199#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {1199#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:22:09,579 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1199#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {1180#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {1176#false} is VALID [2022-04-27 10:22:09,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {1176#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {1176#false} is VALID [2022-04-27 10:22:09,579 INFO L272 TraceCheckUtils]: 25: Hoare triple {1176#false} call __VERIFIER_assert(#t~ret9); {1176#false} is VALID [2022-04-27 10:22:09,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-04-27 10:22:09,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-04-27 10:22:09,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-04-27 10:22:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:22:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:22:09,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487881272] [2022-04-27 10:22:09,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487881272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:22:09,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743231762] [2022-04-27 10:22:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:09,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:22:09,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:22:09,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:22:09,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process